深度优先遍历和宽度优先遍历问题

Pacific Atlantic Water Flow(https://leetcode.com/problems/pacific-atlantic-water-flow/description/)

Sol1(BFS):

设置两个visited数组记录两个大洋边界宽搜的结果，则两个visited都访问过的节点就是结果。

class Solution {
public:
    typedef pair<int, int> Pair;
    vector<pair<int, int>> pacificAtlantic(vector<vector<int>>& matrix) {
        vector<Pair> ans;
        if(matrix.empty())
            return ans;
        m=matrix.size(),n=matrix[0].size();
        vector<vector<bool>> pvis(m,vector<bool>(n,false)),avis(m,vector<bool>(n,false));
        queue<Pair> pque,aque;
        for(int i=0;i<m;++i){
            pque.push(Pair(i,0));
            aque.push(Pair(i,n-1));
            pvis[i][0]=true;
            avis[i][n-1]=true;
        }
        for(int j=0;j<n;++j){
            pque.push(Pair(0,j));
            aque.push(Pair(m-1,j));
            pvis[0][j]=true;
            avis[m-1][j]=true;
        }
        bfs(matrix,pvis,pque);
        bfs(matrix,avis,aque);
        for(int i=0;i<m;++i){
            for(int j=0;j<n;++j){
                if(pvis[i][j]&&avis[i][j])
                    ans.emplace_back(Pair(i,j));
            }
        }
        return ans;
    }
private:
    void bfs(const vector<vector<int>>& matrix,vector<vector<bool>>& vis,queue<Pair>& que){
        while(!que.empty()){
            Pair pn=que.front();
            que.pop();
            int h=matrix[pn.first][pn.second];
            for(int i=0;i<4;++i){
                int u=pn.first+dx[i],v=pn.second+dy[i];
                if(u<0||u>=m||v<0||v>=n||vis[u][v]||matrix[u][v]<h)
                    continue;
                vis[u][v]=true;
                que.push(Pair(u,v));
            }
        }
    }
private:
    int m,n;
    const int dx[4]={-1,1,0,0};
    const int dy[4]={0,0,-1,1};
};

Sol2(DFS):

class Solution {
public:
    typedef pair<int, int> Pair;
    vector<pair<int, int>> pacificAtlantic(vector<vector<int>>& matrix) {
        vector<Pair> ans;
        if(matrix.empty())
            return ans;
        m=matrix.size(),n=matrix[0].size();
        vector<vector<bool>> pvis(m,vector<bool>(n,false)),avis(m,vector<bool>(n,false));
        for(int i=0;i<m;++i){
            dfs(matrix,pvis,matrix[i][0],i,0);
            dfs(matrix,avis,matrix[i][n-1],i,n-1);
        }
        for(int j=0;j<n;++j){
            dfs(matrix,pvis,matrix[0][j],0,j);
            dfs(matrix,avis,matrix[m-1][j],m-1,j);
        }
        for(int i=0;i<m;++i){
            for(int j=0;j<n;++j){
                if(pvis[i][j]&&avis[i][j])
                    ans.emplace_back(Pair(i,j));
            }
        }
        return ans;
    }
private:
    void dfs(const vector<vector<int>>& matrix,vector<vector<bool>>& vis,int h,int x,int y){
        vis[x][y]=true;
        for(int i=0;i<4;++i){
            int u=x+dx[i],v=y+dy[i];
            if(u<0||u>=m||v<0||v>=n||vis[u][v]||matrix[u][v]<h)
            continue;
            dfs(matrix,vis,matrix[u][v],u,v);
        }
    }
private:
    int m,n;
    const int dx[4]={-1,1,0,0};
    const int dy[4]={0,0,-1,1};
};