Shengwei Peng

Leetcode 题解 - 树 437. Path Sum III Solution 需要更新

8

437：新test case中 sum值会超过 Integer.MAX_VALUE 导致不过下面这个test case ``` Input: [1000000000,1000000000,null,294967296,null,1000000000,null,1000000000,null,1000000000] 0 Output: 2 Expected: 0 ``` 新Solution: 可以把 pathSumStartWithRoot input 的int sum改成 long sum ``` public int pathSum(TreeNode root, int sum)...