dfs bfs模板

记忆化的命名：cache 或者 dp
放到类外cache是所有测试用例共享的，放到类内每个用力都得执行一遍，因此在类外速度会更快。

1：二维bfs

int xy[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int flag[305][305] = {0};

void bfs(vector<vector<char>>& grid, int x, int y) {
	int n = grid.size(), m = grid[0].size();
	queue<pair<int, int>> q;
	q.push({x, y});
	flag[x][y] = true;  
	while (!q.empty()) {
		auto frt = q.front();
		q.pop();
		//ans2++ 统计搜索的数目
		int first = frt.first;
		int second = frt.second;
		for (int i = 0; i < 4; ++i) {
			int xx = first + xy[i][0];
			int yy = second + xy[i][1];
			if (xx < 0 || xx > n - 1 || yy < 0 || yy > m - 1) continue;
			if (grid[xx][yy] == '1' && !flag[xx][yy]) {
				q.push({xx, yy});
				flag[xx][yy] = true;
			}
		} 
	}
}
int main(){
	int n = grid.size(), m = grid[0].size(), ans = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (grid[i][j] == '1' && !flag[i][j]) {
                    //ans++;  统计块的数目
                    bfs(grid, i, j);
            }
		}
	}
	cout << ans << endl;
}

2：二维dfs

int xy[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int flag[305][305] = {0};

void dfs(vector<vector<char>>& grid, int x, int y) {
	int n = grid.size(), m = grid[0].size();
	flag[x][y] = 1;
	for (int i = 0; i < 4; ++i) {
        int xx = x + xy[i][0];
        int yy = y + xy[i][1];
        if (xx < 0 || xx > n - 1 || yy < 0 || yy > m - 1) continue;
        if (grid[xx][yy] == '1' && !flag[xx][yy]) {
            dfs(grid, xx, yy);
        }
    }
}..
//ans2++ 统计搜索的总数目
int dfs(vector<vector<int>>& grid, int x, int y) { //int
        int n = grid.size(), m = grid[0].size();
        flag[x][y] = 1;
        int cnt = 1; //cnt = 1
        for (int i = 0; i < 4; ++i) {
            int xx = x + xy[i][0], yy = y + xy[i][1];
            if (xx < 0 || xx > n - 1 || yy < 0 || yy > m - 1) continue;
            if (grid[xx][yy] == 1 && !flag[xx][yy]) cnt += dfs(grid, xx, yy); //cnt +=
        }
        return cnt;
    }

3.图
4.并查集