LeetCode刷题记202-Scanning line(扫描线)

210. 课程表 II

class Solution {
    public int[] findOrder(int numCourses, int[][] prerequisites) {
        int[] indeg = new int[numCourses];
        List<Integer>[] g = new ArrayList[numCourses];
        for (int[] prerequisity : prerequisites) {
            indeg[prerequisity[0]] ++;
            if (g[prerequisity[1]] == null) g[prerequisity[1]] = new ArrayList<Integer>();
            g[prerequisity[1]].add(prerequisity[0]);
        }

        Queue<Integer> q = new LinkedList<Integer>();
        for (int i = 0; i < numCourses; i ++) {
            if (indeg[i] == 0) q.add(i);
        }
        int[] ans = new int[numCourses];
        int id = 0;
        while (!q.isEmpty()) {
            int cur = q.poll();
            ans[id ++] = cur;
            if (g[cur] == null) continue;
            for (int i : g[cur]) {
                indeg[i] --;
                if (indeg[i] == 0) q.add(i);
            }
        }
        if (id == numCourses) return ans;
        return new int[0];
    }
}

329. 矩阵中的最长递增路径

class Solution {
    int[][] dir = {{0, 1}, {1, 0}, {-1, 0}, {0 , -1}};
    public int longestIncreasingPath(int[][] matrix) {
        int n = matrix.length;
        int m = matrix[0].length;
        int[] indeg = new int[m * n];
        List<Integer>[] sons = new ArrayList[m * n];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                int id1 = i * m + j;
                for (int k = 0; k < 4; k ++) {
                    int _i = i + dir[k][0];
                    int _j = j + dir[k][1];
                    if (_i >= 0 && _i < n && _j >=0 && _j < m && matrix[i][j] < matrix[_i][_j]) {
                        int id2 = _i * m + _j;
                        indeg[id2] ++;
                        if (sons[id1] == null) sons[id1] = new ArrayList<Integer>();
                        sons[id1].add(id2);
                    }
                }
            }
        }

        int[] len = new int[m * n];
        Queue<Integer> q = new LinkedList<Integer>();
        for (int i = 0; i < m * n; i ++) {
            if (indeg[i] == 0 && sons[i] != null) q.add(i);
        }
        while (!q.isEmpty()) {
            int cur = q.poll();
            for (int i : sons[cur]) {
                indeg[i] --;
                len[i] = Math.max(len[i], len[cur] + 1);
                if (indeg[i] == 0 && sons[i] != null) q.add(i);
            }
        }
        int ans = 0;
        for (int i = 0; i < n * m; i++) ans = Math.max(ans, len[i]);
        return ans + 1;
    }
}