-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnumber_of_islands.ts
73 lines (59 loc) · 1.74 KB
/
number_of_islands.ts
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
70
71
72
73
/*
200. Number of Islands
Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water),
return 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: grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
Output: 1
Example 2:
Input: grid = [
["1","1","0","0","0"],
["1","1","0","0","0"],
["0","0","1","0","0"],
["0","0","0","1","1"]
]
Output: 3
Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] is '0' or '1'.
*/
function numIslands(grid: string[][]): number {
let countIslands = 0;
for (let rowIndex in grid) {
for (let colIndex in grid[rowIndex]) {
if (grid[rowIndex][colIndex] === "1") {
countIslands++;
terraform(parseInt(rowIndex), parseInt(colIndex), grid);
}
}
}
return countIslands;
};
//Function will recursively call itsellf and mark island as water in four direction,
// it will help to avoid double check and count island as another one.
function terraform(rowIndex: number, colIndex: number, grid: string[][]): void {
if (grid[rowIndex] === undefined || grid[rowIndex][colIndex] === undefined || grid[rowIndex][colIndex] === "0") {
return;
}
grid[rowIndex][colIndex] = "0";
terraform(rowIndex+1, colIndex, grid);
terraform(rowIndex-1, colIndex, grid);
terraform(rowIndex, colIndex+1, grid);
terraform(rowIndex, colIndex-1, grid);
}
const result = numIslands([
["1","1","0","0","0"],
["1","1","0","0","0"],
["0","0","1","0","0"],
["0","0","0","1","1"]
]);
console.log(result);