getPath(root.left, sum, curVal, res, curli); curli.remove(curli.size()-1); }if(root.right!=null){ getPath(root.right, sum, curVal, res, curli); curli.remove(curli.size()-1); } } }
LeetCode之“动态规划”:MinimumPathSum && UniquePaths&& UniquePathsII 之所以将这三道题放在一起,是因为这三道题非常类似。 1.MinimumPathSum 题目链接 题目要求: Given amxngrid filled with non-negative numbers, find apathfrom top left to bottom rig... ...