[leetcode] 329. Longest Increasing Path in a Matrix 解题报告

题目链接：https://leetcode.com/problems/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 + 记忆化搜索. 使用一个hash表来记录已经搜索过的路径。在第一次传上一个位置值的时候需要一个小于任何一个int的值, 这样可以保证边界值正确.

代码如下：

class Solution {
public:
    int DFS(vector<vector<int>>& matrix, int x, int y, long val)
    {
        int row = matrix.size(), col = matrix[0].size();
        if(x<0||x>=row||y<0||y>=col||matrix[x][y]<=val) return 0;
        if(hash.count(x*col +y)) return hash[x*col+y];
        int len1 = DFS(matrix, x+1, y, matrix[x][y]);
        int len2 = DFS(matrix, x-1, y, matrix[x][y]);
        int len3 = DFS(matrix, x, y+1, matrix[x][y]);
        int len4 = DFS(matrix, x, y-1, matrix[x][y]);
        int Max = max(max(len1, len2), max(len3, len4)) + 1;
        hash[x*col+y] = Max;
        return Max;
    }
    
    int longestIncreasingPath(vector<vector<int>>& matrix) {
        if(matrix.size() ==0) return 0;
        int row = matrix.size(), col = matrix[0].size(), ans = 0;
        for(int i = 0; i < row; i ++)
            for(int j =0; j < col; j++)
                ans = max(ans, DFS(matrix, i, j, LONG_MIN));
        return ans;
    }
private:
    unordered_map<int, int> hash;
};