leetcode 694. Number of Distinct Islands（BFS）

题目：https://leetcode.com/contest/leetcode-weekly-contest-53/problems/number-of-distinct-islands/
题意：给你一个01图，让你找出有多少不同的联通块（相同意为可以通过平移得到）
思路：BFS保存每次走的方向
代码：

#include<bits/stdc++.h>
using namespace std;
#define MP make_pair
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};

class Solution {
public:
    int n,m;
    set< vector<int> > s;

    void bfs(int x,int y,vector<vector<int>>& grid){
        queue< pair<int,int> > q;
        q.push(MP(x,y));
        grid[x][y] = 0;

        vector<int> v;
        while(!q.empty()){
            x = q.front().first,y = q.front().second;
            q.pop();
            for(int i = 0;i < 4;i++){
                int nx = x + dx[i];
                int ny = y + dy[i];
                if(0 <= nx && nx < n && 0 <= ny && ny < m && grid[nx][ny]){
                    grid[nx][ny] = 0;
                    q.push(MP(nx,ny));
                    v.push_back(i);//direction
                }
                else
                    v.push_back(5);
            }
        }
        s.insert(v);
    }
    int numDistinctIslands(vector<vector<int>>& grid) {
        n = grid.size();
        //if(!n) return 0;
        m = grid[0].size();
        s.clear();
        for(int i = 0;i < grid.size();i++)
            for(int j = 0;j < grid[i].size();j++)
                if(grid[i][j])
                    bfs(i,j,grid);
        return s.size();
    }
};