qq_52993545的博客

https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix/ 第一次接触记忆化搜索，和动态规划很像。动态规划是自底向上，记忆化搜索时自顶向下。 class Solution { public: const static int SIZE = 105; int res = 0; vector<int> path; int dirX[4] = {1, -1, 0, 0}; .