LeetCode329. 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:

Input: nums = 
[
  [9,9,4],
  [6,6,8],
  [2,1,1]
] 
Output: 4 
Explanation: The longest increasing path is [1, 2, 6, 9].

Example 2:

Input: nums = 
[
  [3,4,5],
  [3,2,6],
  [2,2,1]
] 
Output: 4 
Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.

这道题我们主要参考了文章：here。

这道题第一反应是使用回溯的方式解决，但是发现这样的时间复杂度太高；参考网上的资料才发现可以使用动态规划。

class Solution {
private: 
	vector<vector<int>> dp, input;
	vector<pair<int, int>> directions{ {-1,0},{1,0},{0,-1},{0,1} };
	int m, n;
public:
	int getResult(pair<int, int> coordinate) {
		if (dp[coordinate.first][coordinate.second] > -1) return dp[coordinate.first][coordinate.second];
		dp[coordinate.first][coordinate.second] = 1;
		for (pair<int, int> dir : directions) {
			pair<int, int> new_coor = make_pair(coordinate.first + dir.first, coordinate.second + dir.second);
			if (new_coor.first >= 0 && new_coor.first < m && new_coor.second >= 0 && new_coor.second < n) {
				if (input[coordinate.first][coordinate.second] > input[new_coor.first][new_coor.second]) {
					dp[coordinate.first][coordinate.second] = max(dp[coordinate.first][coordinate.second], getResult(make_pair(new_coor.first, new_coor.second)) + 1);
				}
			}
		}
		return dp[coordinate.first][coordinate.second];
	}

	int longestIncreasingPath(vector<vector<int>>& matrix) {
		m = int(matrix.size()); n = int(matrix[0].size());
		input = matrix;
		dp = vector<vector<int>>(m, vector<int>(n, -1));

		int res = 0;
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				res = max(res, getResult(make_pair(i, j)));
			}
		}
		return res;
	}
};