LeetCode 694不同岛屿数量

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:
11000
11000
00011
00011
Given the above grid map, return 1.
Example 2:
11011
10000
00001
11011
Given the above grid map, return 3.

Notice that:
11
1
and
1
11
are considered different island shapes, because we do not consider reflection / rotation.

如果直接求岛屿数量，用DFS即可，问题在于岛屿形状问题，首先看一下200题的岛屿数量

public int numDistinctIslands(int[][] grid) {
   
        
        if (grid == null || grid.length == 0){
   return 0;}
        int count = 0;
        for (int i = 0; i < grid.length; i++){
   
            for (int j = 0; j < grid[0].length; j++){
   
            if (grid[i][j] == 1){
   
                dfs(grid,i,j);
                count++;
             }
           }
        }
             
        return count;      
    }  
    //dfs 所有独立的岛屿
    private void dfs(int[][] grid, int row, int col){
   
      int r = grid.length;
      int c = grid[0].length;
     
      if (row < 0 || row >= r || col<0 || col >= c){
   
        return;
      }
      if (grid[row][col] !=1){
   
          return;
      }
     //做一下标记防止重复
      grid