算法刷题(6)--寻岛算法
package p1;
/**
* 寻岛个数算法实现
* @author Guozhu Zhu
* @date 2018/4/17
* @version 1.0
*
*/
public class Test07 {
/*
* | 0 | 0 | 0 | 0 |
* | 0 | 1 | 1 | 1 |
* | 0 | 0 | 1 | 1 |
* | 1 | 0 | 0 | 0 |
* 输出的结果为: 2个岛
*/
public static void main(String[] args) {
char[][] land = {{'0', '0', '0', '0'}, {'0', '1', '1', '1'}, {'0', '0', '1', '1'}, {'1', '0', '0', '0'}};
System.out.println(getAns(land));
}
public static void arroundFind(char arr[][], int i, int j) {
if (i < 0 || j < 0 || i >= arr.length || j >= arr[i].length || arr[i][j] != '1') {
return ;
}
arr[i][j] = '0';
arroundFind(arr, i+1, j);
arroundFind(arr, i-1, j);
arroundFind(arr, i, j-1);
arroundFind(arr, i, j+1);
}
/*
* 深度优先搜索算法
*/
public static int getAns(char arr[][]) {
int ans = 0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
if (arr[i][j] == '1') {
arroundFind(arr, i, j);//广度优先搜索算法
ans++;
}
}
}
return ans;
}
}