文章目录
155. 最小栈【简单】
https://leetcode-cn.com/problems/min-stack/
112. 路径总和【简单】
https://leetcode-cn.com/problems/path-sum/
class Solution {
public boolean hasPathSum(TreeNode root, int targetSum) {
if(root == null) return false;
if(root.left == null && root.right == null)
return targetSum - root.val == 0;
return hasPathSum(root.left, targetSum - root.val) || hasPathSum(root.right, targetSum - root.val);
}
}
113. 路径总和 II【中等】
https://leetcode-cn.com/problems/path-sum-ii/
4. 寻找两个正序数组的中位数【困难】
https://leetcode-cn.com/problems/median-of-two-sorted-arrays/
