LeetCode OJ Number of Islands

Given a 2d grid map of '1's (land) and'0's (water),count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

11110
11010
11000
00000

Answer: 1

Example 2:

11000
11000
00100
00011

Answer: 3

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

int R,C; int dir[4][2] = { 1,⑴,1,⑴ }; bool ** vis; char ** G; void dfs(int pi,int pj) { vis[pi][pj] = true; int npi,npj; for (int i = 0; i < 4; i++) { npi = pi + dir[i][0]; npj = pj + dir[i][1]; if (0 <= npi && npi < R && 0 <= npj && npj < C && !vis[npi][npj] && G[npi][npj] == '1') dfs(npi,npj); } } int numIslands(char **grid,int numRows,int numColumns) { G = grid; vis = (bool **)malloc(sizeof(bool*) * numRows); for (int i = 0; i < numRows; i++) vis[i] = (bool *)malloc(sizeof(bool) * numColumns); for (int i = 0; i < numRows; i++) for (int j = 0; j < numColumns; j++) vis[i][j] = false; int ans = 0; R = numRows; C = numColumns; for (int i = 0; i < numRows; i++) for (int j = 0; j < numColumns; j++) if (!vis[i][j] && G[i][j] == '1') { ans++; dfs(i,j); } for (int i = 0; i < numRows; i++) free(vis[i]); free(vis); return ans; }

相关文章

统一支付是JSAPI/NATIVE/APP各种支付场景下生成支付订单,返...
统一支付是JSAPI/NATIVE/APP各种支付场景下生成支付订单,返...
前言 之前做了微信登录,所以总结一下微信授权登录并获取用户...
FastAdmin是我第一个接触的后台管理系统框架。FastAdmin是一...
之前公司需要一个内部的通讯软件,就叫我做一个。通讯软件嘛...
统一支付是JSAPI/NATIVE/APP各种支付场景下生成支付订单,返...