/*
思路:用bfs/dfs方法找到islands把坐标整理成list存入hashset 最后hashset里面list的数量就是最后的个数。
注意:主要问题是怎么把坐标存起来,可以按照coding的方式 以开始为起点 上下左右为1,2,3,4步骤如果是岛屿就把步骤号存入list 每个点四次结束后存0用以分开每层的步骤;
*/
public class Solution {
/**
* @param grid: a list of lists of integers
* @return: return an integer, denote the number of distinct islands
*/
public int numberofDistinctIslands(int[][] grid) {
if(grid == null || grid.length == 0 || grid[0].length == 0) return 0;
List<Integer> list;
Set<List<Integer>> hash = new HashSet<>();
for(int i = 0; i < grid.length; i++) {
for(int j = 0; j < grid[0].length; j++) {
if(grid[i][j] == 1) {
list = new ArrayList<>();
dfs(grid, i, j, list, 0);
hash.add(list);
}
}
}
return hash.size();
}
private void dfs(int[][] grid, int i, int j, List<Integer> list, int step) {
if(i >= 0 && i < grid.length && j >= 0 && j < grid[0].length && grid[i][j] == 1) {
grid[i][j] = 0;
list.add(step);
dfs(grid, i - 1, j, list, 1);
dfs(grid, i + 1, j, list, 2);
dfs(grid, i, j - 1, list, 3);
dfs(grid, i, j + 1, list, 4);
list.add(0);
}
}
}
Number of Distinct Islands leetcode java 走地牙
最新推荐文章于 2020-05-03 08:50:33 发布