目录

题目

解法一

---

题目

待添加

解法一

int max(int a, int b) {return a > b ? a : b;
}int search(int** matrix, int m, int n, int i, int j, int (*dp)[n]) {if (dp[i][j]) {return dp[i][j];}int len = 0;if (i > 0 && matrix[i - 1][j] > matrix[i][j]) {len = max(len, search(matrix, m, n, i - 1, j, dp));}if (i + 1 < m && matrix[i + 1][j] > matrix[i][j]) {len = max(len, search(matrix, m, n, i + 1, j, dp));}if (j > 0 && matrix[i][j - 1] > matrix[i][j]) {len = max(len, search(matrix, m, n, i, j - 1, dp));}if (j + 1 < n && matrix[i][j + 1] > matrix[i][j]) {len = max(len, search(matrix, m, n, i, j + 1, dp));}dp[i][j] = len + 1;return dp[i][j];
}int longestIncreasingPath(int** matrix, int matrixSize, int* matrixColSize) {const int m = matrixSize, n = *matrixColSize;int dp[m][n];memset(dp, 0, sizeof(dp));int len = 0;for (int i = 0; i < m; i++) {for (int j = 0; j < n; j++) {len = max(len, search(matrix, m, n, i, j, dp));}}return len;
}