694. Number of Distinct Islands

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.

Note: The length of each dimension in the given grid does not exceed 50.

Rust Solution

struct Solution;
use std::collections::HashSet;

#[derive(Hash, PartialEq, Eq, Debug)]
enum Direction {
    Up,
    Right,
    Down,
    Left,
    Back,
}

type Island = Vec<Direction>;

impl Solution {
    fn num_distinct_islands(mut grid: Vec<Vec<i32>>) -> i32 {
        let n = grid.len();
        let m = grid[0].len();
        let mut hs: HashSet<Island> = HashSet::new();
        for i in 0..n {
            for j in 0..m {
                if grid[i][j] == 1 {
                    let mut island: Island = vec![];
                    Self::dfs(i, j, &mut grid, &mut island, n, m);
                    hs.insert(island);
                }
            }
        }
        hs.len() as i32
    }

    fn dfs(i: usize, j: usize, grid: &mut Vec<Vec<i32>>, island: &mut Island, n: usize, m: usize) {
        use Direction::*;
        grid[i][j] = 0;
        if i > 0 && grid[i - 1][j] == 1 {
            island.push(Up);
            Self::dfs(i - 1, j, grid, island, n, m);
        }
        if j > 0 && grid[i][j - 1] == 1 {
            island.push(Left);
            Self::dfs(i, j - 1, grid, island, n, m);
        }
        if i + 1 < n && grid[i + 1][j] == 1 {
            island.push(Down);
            Self::dfs(i + 1, j, grid, island, n, m);
        }
        if j + 1 < m && grid[i][j + 1] == 1 {
            island.push(Right);
            Self::dfs(i, j + 1, grid, island, n, m);
        }
        island.push(Back);
    }
}

#[test]
fn test() {
    let grid = vec_vec_i32![
        [1, 1, 0, 0, 0],
        [1, 1, 0, 0, 0],
        [0, 0, 0, 1, 1],
        [0, 0, 0, 1, 1]
    ];
    let res = 1;
    assert_eq!(Solution::num_distinct_islands(grid), res);
    let grid = vec_vec_i32![
        [1, 1, 0, 1, 1],
        [1, 0, 0, 0, 0],
        [0, 0, 0, 0, 1],
        [1, 1, 0, 1, 1]
    ];
    let res = 3;
    assert_eq!(Solution::num_distinct_islands(grid), res);
    let grid = vec_vec_i32![[1, 1, 0], [0, 1, 1], [0, 0, 0], [1, 1, 1], [0, 1, 0]];
    let res = 2;
    assert_eq!(Solution::num_distinct_islands(grid), res);
}

Having problems with this solution? Click here to submit an issue on github.