[LeetCode]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.

DFS搜寻，修改下向大值移动的规则。

为了避免点重复搜寻，用了一个visited数组记录已经搜寻到的点。否则通不过时间测试。

class Solution {
public:
    int longestIncreasingPath(vector<vector<int>>& matrix) {
        int depth = 0;
        int m = matrix.size();
        if(m==0)    return 0;
        int n = matrix[0].size();
        vector<vector<int>> visited(m,vector<int>(n,1));
        for(int i=0; i<m; ++i)
            for(int j=0; j<n; ++j){
                depth = max(depth,Dfs(matrix,visited,i,j));
            }
        return depth;
    }
    
    int Dfs(vector<vector<int>>& matrix,vector<vector<int>>& visited,int x,int y){
        int height = matrix.size();
        int width = matrix[0].size();
        if(visited[x][y]>1)
            return visited[x][y];
        int result = 1;
        int Cur = matrix[x][y];
        int nx,ny = 0;
        for(int i=0; i<4; ++i){
            if(i==0) { nx = x-1; ny = y;}
            if(i==1) { nx = x+1; ny = y;}
            if(i==2) { nx = x; ny = y-1;}
            if(i==3) { nx = x; ny = y+1;}
            if(nx<0||nx>=height||ny<0||ny>=width||matrix[nx][ny]<=matrix[x][y]) continue;//非搜寻的解
            result = max(result, Dfs(matrix,visited,nx,ny)+1);   //不记录就会重复DFS超时
            visited[x][y] = result; //记录已经访问过的点
        }
        return result;
    }
};