Leetcode 329. Longest Increasing Path in a Matrix

题目：

Given an integer matrix, find the length of the longest increasing path.

From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).

Example 1:

nums = [
  [9,9,4],
  [6,6,8],
  [2,1,1]
]

Return 4
The longest increasing path is [1, 2, 6, 9].

Example 2:

nums = [
  [3,4,5],
  [3,2,6],
  [2,2,1]
]

Return 4
The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.

思路：拓扑排序，二维图转化为一个图，节点数为N*M；每轮去除入度为0的点，最后的轮数就是最长路径。

int d[4][2] = {-1,0,1,0,0,-1,0,1};
class Solution {
public:
    int longestIncreasingPath(vector<vector<int>>& matrix) {
        if(matrix.size() == 0) return 0;
        int row =matrix.size(), col = matrix[0].size();
        vector<int> indegree(row*col,0);
        unordered_map<int, multiset<int>> hash;
        for(int i = 0; i < row; i++) {
            for(int j = 0; j < col; j++) {
                int t = 0;
                for(int k = 0; k < 4; k++) {
                    int x = i + d[k][0];
                    int y = j + d[k][1];
                    if(x >= 0&&x<row&&y>=0&&y<col&&matrix[x][y]<matrix[i][j]) {
                        indegree[x*col+y]++;
                        hash[i*col+j].insert(x*col+y);
                    }
                }
            }
        }
        vector<int> m(indegree.size(),0);
        int n = 0;
        vector<int> s;
        while(1) {
            for(int i = 0; i < indegree.size(); i++) {
                if(m[i]==0&&indegree[i] == 0){
                    m[i] = 1;
                    s.push_back(i);
                }
            }
            if(!s.empty()) {
                for(auto val:s) {
                    for(auto q:hash[val]) indegree[q]--;
                }
                n++;
                s.clear();
            } else {
                return n;
            }

        }
    }
};

其他思路就是DFS+记忆化搜索，拓扑的计算时间长，因为DFS每个点只需遍历一遍。

class Solution {
public:
    vector<vector<int>> best;
    int n, m;
    
    int dx[4] = {1, -1, 0, 0};
    int dy[4] = {0, 0, 1, -1};
    
    bool inrange(int x, int y){
        return 0 <= x and x < n and 0 <= y and y < m;
    }
    
    int longestIncreasingPath(vector<vector<int>>& matrix) {
        n = matrix.size(); if(!n) return 0;
        m = matrix[0].size(); if(!m) return 0;
        
        best.resize(n, vector<int> (m, 0));
        
        int ans = 0;
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                ans = max(ans, dfs(i, j, matrix));
            }
        }
        
        return ans;
    }
    
    int dfs(int x, int y, vector<vector<int>> &matrix){
        if(best[x][y]) return best[x][y];
        best[x][y] = 1;
        
        for(int i = 0; i < 4; i++){
            int nx = x + dx[i];
            int ny = y + dy[i];
            
            if(inrange(nx, ny) and matrix[x][y] < matrix[nx][ny]){
                best[x][y] = max(best[x][y], 1 + dfs(nx, ny, matrix));
            }
        }
        
        return best[x][y];
    }
};