-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathIslands.cpp
More file actions
61 lines (50 loc) · 1.4 KB
/
Copy pathIslands.cpp
File metadata and controls
61 lines (50 loc) · 1.4 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
//Copyright [2018] [Haibo Yan]
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.
//
// Created by haibo on 3/24/18.
//
#include "Islands.h"
void Islands::dfs(int i, int j, char e, char n, char o) {
if (i < 0 || i >= matrix.size()) {
return;
}
if (j < 0 || j >= matrix[0].size()) {
return;
}
if (matrix[i][j] != n) {
return;
}
matrix[i][j] = o;
dfs(i - 1, j, e, n, o);
dfs(i + 1, j, e, n, o);
dfs(i, j - 1, e, n, o);
dfs(i, j + 1, e, n, o);
}
int Islands::size() {
if (matrix.size() == 0 || matrix[0].size() == 0) {
return 0;
}
const auto r = matrix.size();
const auto c = matrix[0].size();
int n = 0;
for (auto i = 0; i < r; i++) {
for (auto j = 0; j < c; j++) {
if (matrix[i][j] == '1') {
dfs(i, j, '0', '1', '#');
n++;
}
}
}
return n;
}