forked from yuyongwei/Algorithms-In-Swift
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathnumberOfIslands.swift
More file actions
68 lines (53 loc) · 1.39 KB
/
Copy pathnumberOfIslands.swift
File metadata and controls
68 lines (53 loc) · 1.39 KB
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
/*
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
*/
func numIslands(_ grid: [[Character]]) -> Int {
guard grid.count > 0 else { return 0 }
var current = 2
var grid = grid.map { $0.map { Int(String($0))! } }
func dfs(_ row: Int, _ col: Int) {
// up
if row - 1 >= 0 && grid[row-1][col] == 1 {
grid[row-1][col] = current
dfs(row-1, col)
}
// down
if row + 1 < grid.count && grid[row+1][col] == 1 {
grid[row+1][col] = current
dfs(row+1, col)
}
// left
if col - 1 >= 0 && grid[row][col-1] == 1 {
grid[row][col-1] = current
dfs(row, col-1)
}
// right
if col + 1 < grid[0].count && grid[row][col+1] == 1 {
grid[row][col+1] = current
dfs(row, col+1)
}
}
for i in 0..<grid.count {
for j in 0..<grid[0].count {
if grid[i][j] == 1 {
dfs(i, j)
current = current + 1
}
}
}
return current-2
}