LeetCode—417. Pacific Atlantic Water Flow

最新推荐文章于 2020-07-31 09:45:05 发布

corpsepiges

最新推荐文章于 2020-07-31 09:45:05 发布

阅读量1.4k

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/corpsepiges/article/details/52768171

版权

leetcode 专栏收录该内容

226 篇文章 0 订阅

订阅专栏

Pacific Atlantic Water Flow思路：注意理解一下题目，求的是可以同时去往两边的点，（显然左下角和右上角肯定是符合的），查找一下即可，注意记得标记访问过的点，很普通的题目。

GitHub地址：https://github.com/corpsepiges/leetcode

点此进入如果可以的话，请点一下star，谢谢。

public class Solution {
    boolean[][] rPO;
    int[][] v4PO;
    boolean[][] rAO;
    int[][] v4AO;
    int m;
    int n;
    int[][] matrix;

    public List<int[]> pacificAtlantic(int[][] matrix) {
        this.matrix = matrix;
        m = matrix.length;
        List<int[]> res = new ArrayList<int[]>();
        if (m == 0) {
            return res;
        }
        n = matrix[0].length;
        rPO = new boolean[m][n];
        v4PO = new int[m][n];
        rAO = new boolean[m][n];
        v4AO = new int[m][n];
        for (int i = 0; i < m; i++) {
            visitForPacificOcean(i, 0, 0);
            visitForAtlanticOcean(i, n - 1, 0);
        }
        for (int i = 0; i < n; i++) {
            visitForPacificOcean(0, i, 0);
            visitForAtlanticOcean(m - 1, i, 0);
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (rPO[i][j] && rAO[i][j]) {
                    int[] ans = { i, j };
                    res.add(ans);
                }
            }
        }
        return res;
    }

    public void visitForPacificOcean(int x, int y, int lastHeight) {
        if (x >= 0 && x < m && y >= 0 && y < n && v4PO[x][y] == 0 && matrix[x][y] >= lastHeight) {
            rPO[x][y] = true;
            v4PO[x][y] = 1;
            visitForPacificOcean(x - 1, y, matrix[x][y]);
            visitForPacificOcean(x + 1, y, matrix[x][y]);
            visitForPacificOcean(x, y - 1, matrix[x][y]);
            visitForPacificOcean(x, y + 1, matrix[x][y]);
        }
    }

    public void visitForAtlanticOcean(int x, int y, int lastHeight) {
        if (x >= 0 && x < m && y >= 0 && y < n && v4AO[x][y] == 0 && matrix[x][y] >= lastHeight) {
            rAO[x][y] = true;
            v4AO[x][y] = 1;
            visitForAtlanticOcean(x - 1, y, matrix[x][y]);
            visitForAtlanticOcean(x + 1, y, matrix[x][y]);
            visitForAtlanticOcean(x, y - 1, matrix[x][y]);
            visitForAtlanticOcean(x, y + 1, matrix[x][y]);
        }
    }
}