Leetcode 694: Number of Distinct Islands

最新推荐文章于 2021-11-30 06:01:53 发布

teemo_must_die

最新推荐文章于 2021-11-30 06:01:53 发布

阅读量172

点赞数

文章标签： dfs

本文链接：https://blog.csdn.net/weixin_46442857/article/details/104591298

版权

Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.

Count the number of distinct islands. An island is considered to be the same as another if and only if one island can be translated (and not rotated or reflected) to equal the other.

Example 1:

Given the above grid map, return 1.

Example 2:

Notice that:

11
1

and

 1
11

are considered different island shapes, because we do not consider reflection / rotation.

Solution

This problem is extremely similar to P200. Number of Distinct Island. The only difference is that we need to find the unique ones. Since we do not need to take care of rotation or reflection, we can just use a hashset and a string representation, which keeps track of our DFS workflow, to find the distinct ones. Here is one type of implementation.

class Solution {
    public int numDistinctIslands(int[][] grid) {
        if (grid == null || grid.length == 0) return 0;
        int m = grid.length, n = grid[0].length;
        
        Set<String> unique_island = new HashSet<>();
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if (grid[i][j] == 1) {
                    StringBuilder sb = new StringBuilder();
                    dfs(grid, i, j, m, n, sb, "O");
                    unique_island.add(sb.toString());
                }
            }
        }
        
        return unique_island.size();
    }
    
    private void dfs(int[][] grid, int i, int j, int m, int n, StringBuilder sb, String dir) {
        if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] == 0) return;
        grid[i][j] = 0;
        sb.append(dir);
        dfs(grid, i - 1, j, m, n, sb, "N");
        dfs(grid, i + 1, j, m, n, sb, "S");
        dfs(grid, i, j - 1, m, n, sb, "W");
        dfs(grid, i, j + 1, m, n, sb, "E");
        sb.append("B");
    } 
}