-
Notifications
You must be signed in to change notification settings - Fork 154
/
number-of-islands.js
69 lines (59 loc) · 1.14 KB
/
number-of-islands.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/**
* 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:
*
* Input:
* 11110
* 11010
* 11000
* 00000
*
* Output: 1
* Example 2:
*
* Input:
* 11000
* 11000
* 00100
* 00011
*
* Output: 3
*/
/**
* @param {character[][]} grid
* @return {number}
*/
const numIslands = grid => {
if (!grid || grid.length === 0) {
return 0;
}
const m = grid.length;
const n = grid[0].length;
let count = 0;
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
if (grid[i][j] === '1') {
dfs(grid, m, n, i, j);
count++;
}
}
}
return count;
};
const dfs = (grid, m, n, i, j) => {
if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] === '0') {
return;
}
grid[i][j] = '0';
const dx = [0, 0, -1, 1];
const dy = [-1, 1, 0, 0];
for (let k = 0; k < 4; k++) {
dfs(grid, m, n, i + dx[k], j + dy[k]);
}
};
export { numIslands };