力扣329——矩阵中的最长递增路径
使用dfs(深度优先),虽然是困难等级,但是还是比较简单的。
使用vis数组标记是否访问过
使用dp数组储存访问过的点的长度,如果再次访问直接返回数值就行,不需要进行dfs,应该是m*n的时间复杂度。
注意细节
class Solution {
public:
vector <vector <int>>s;
vector <vector <int>>vis;
vector <vector <int>>dp;
int m, n;
int dfs(int i, int j, int x) {
if (i == -1 || i == m || j == -1 || j == n) {
return 0;
}
if (vis[i][j] == 1) {
if (s[i][j] > x) {
return dp[i][j];
}
else {
return 0;
}
}
int a, b, c, d;
if (s[i][j] > x) {
vis[i][j] = 1;
a = dfs(i + 1, j, s[i][j]);
b = dfs(i, j + 1, s[i][j]);
c = dfs(i - 1, j, s[i][j]);
d = dfs(i, j - 1, s[i][j]);
dp[i][j] = max(max(a, b), max(c, d)) + 1;
return dp[i][j];
}
else {
return 0;
}
}
int longestIncreasingPath(vector<vector<int>>& mp) {
m = mp.size();
if (m==0){
return 0;
}
n = mp[0].size();
s = mp;
vector <int>t1;
vector <int>t2;
for (int i = 0; i < n; i++) {
t1.push_back(0);
t2.push_back(1);
}
for (int i = 0; i < m; i++) {
vis.push_back(t1);
dp.push_back(t2);
}
int maxn = 1;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (vis[i][j] == 0) {
maxn = max(dfs(i, j,0-(int)1e5), maxn);
}
}
}
return maxn;
}
};