-
Notifications
You must be signed in to change notification settings - Fork 28
/
Contents.swift
72 lines (62 loc) 路 2.37 KB
/
Contents.swift
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
import Foundation
/*
Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.
A region is captured by flipping all 'O's into 'X's in that surrounded region.
Example:
X X X X
X O O X
X X O X
X O X X
After running your function, the board should be:
X X X X
X X X X
X X X X
X O X X
Explanation:
Surrounded regions shouldn鈥檛 be on the border, which means that any 'O' on the border of the board are not flipped to 'X'. Any 'O' that is not on the border and it is not connected to an 'O' on the border will be flipped to 'X'. Two cells are connected if they are adjacent cells connected horizontally or vertically.
*/
func solve(_ board: inout [[Character]]) {
if board.count == 0 { return }
var visited = Array(repeating: Array(repeating: 0, count: board[0].count), count: board.count)
solveHelper(&board, visited: &visited)
}
func solveHelper(_ board: inout [[Character]], visited: inout [[Int]]) {
for row in 0 ..< board.count {
for column in 0 ..< board[row].count {
if row > 0,
row < board.count - 1,
column > 0,
column < board[row].count - 1
{
continue
}
findAdjacent(row: row, column: column, board: &board, visited: &visited)
}
}
for row in 0 ..< board.count {
for column in 0 ..< board[row].count {
if visited[row][column] == 0 {
board[row][column] = "X"
}
}
}
}
func findAdjacent(row: Int, column: Int, board: inout [[Character]], visited: inout [[Int]]) {
guard row >= 0, row < board.count else { return }
guard column >= 0, column < board[row].count else { return }
if board[row][column] == "O",
visited[row][column] == 0
{
visited[row][column] = 1
//up
findAdjacent(row: row - 1, column: column, board: &board, visited: &visited)
//left
findAdjacent(row: row, column: column - 1, board: &board, visited: &visited)
//right
findAdjacent(row: row, column: column + 1, board: &board, visited: &visited)
//down
findAdjacent(row: row + 1, column: column, board: &board, visited: &visited)
}
}
var board: [[Character]] = [["X","O","X","O","X","O"],["O","X","O","X","O","X"],["X","O","X","O","X","O"],["O","X","O","X","O","X"]]
solve(&board)