Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
61 lines (53 loc) · 1.35 KB

File metadata and controls

61 lines (53 loc) · 1.35 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
import java.util.ArrayList;
import java.util.List;
import java.util.TreeMap;
/**
*
* Remove all elements from a linked list of integers that have value val.
*
* Example:
*
* Input: 1->2->6->3->4->5->6, val = 6
* Output: 1->2->3->4->5
*
* @authorLiu.3502
* @created2018-01-31 下午6:45
*/
public class LC112_PathSum {
public static class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
public static void main(String[] args) {
ListNode root = new ListNode(0);
ListNode ans = hasPathSum(root,0);
System.out.println(ans);
}
//O(N)
public boolean hasPathSum(TreeNode root, int sum) {
//sanity check
if(root == null){
return false;
}
returen pathSum(root, 0, sum);
}
public boolean pathSum(TreeNode root, int cur, int sum){
if(root == null){
return cur == sum;
}
if(pathSum(root.left, cur + root.val, sum) || pathSum(root.right, cur + root.val, sum)){
return true;
}
return false;
}
//切记 sum == 0 时候 root == null 不能判断
//必须要把base case改好
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null) return false;
if(root.left == null && root.right == null && root.val == sum){
return true;
}
return hasPathSum(root.left, sum - root.val)|| hasPathSum(root.right, sum - root.val);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.