【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.

分析：
这道题目要求我们求出一个矩阵中最长的递增路径。我的思路是将每一个结点都作为起点进行深度优先遍历，找到其最长的递增路径，再比较哪个结点对应的路径最长。
为了减少不必要的遍历，通过向量depth将每一个结点对应的最长路径保存下来，就可以重复使用。

代码：

class Solution {
public:

    int DFS(vector<vector<int>>& matrix,int i,int j,vector<vector<int>>&depth)
    {
        int dir[4][2] = {{-1,0},{1,0},{0,-1},{0,1}};//上、下、左、右四个方向
        if(depth[i][j]>0)
        return depth[i][j];
        int row = matrix.size(),col = matrix[0].size();
        int max = 1,temp = 0;
        for(int p = 0;p<4;p++)
        {
            int x = i+dir[p][0];
            int y = j+dir[p][1];
            if(x>=0&&x<row&&y>=0&&y<col)
            {
                if(matrix[x][y]>matrix[i][j])
                temp = 1+DFS(matrix,x,y,depth);
                if(max<temp)
                max = temp;
            }
        }
        depth[i][j] = max;
        return max;

    }
    int longestIncreasingPath(vector<vector<int>>& matrix) {
        queue<int> q;
        int result = 0;
        vector<vector<int>>depth;
        for(int i = 0;i<matrix.size();i++)
        depth.push_back(vector<int>());
        for(int i = 0;i<matrix.size();i++)
        {
            for(int j = 0;j<matrix[i].size();j++)
            {
                depth[i].push_back(0);
            }
        }
        for(int i = 0;i<matrix.size();i++)
        {
            for(int j = 0;j<matrix[i].size();j++)
            {
                int temp = DFS(matrix,i,j,depth);
                if(temp>result)
                result = temp;
            }
        }
        return result;
    }
};