摘要:
思路很简单,就是存储之前运算的结果,然后递归class Solution {public: int** dp; int get_min_sum(vector > &grid, int m, int n) { if (dp[m][n] != -1) ... 阅读全文
摘要:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文