1+ /**
2+ * Definition for a binary tree node.
3+ * public class TreeNode {
4+ * int val;
5+ * TreeNode left;
6+ * TreeNode right;
7+ * TreeNode(int x) { val = x; }
8+ * }
9+ */
10+ import java .util .*;
11+ 12+ class Pair {
13+ TreeNode node ;
14+ Integer sum ;
15+ public Pair (TreeNode node , Integer sum ) {
16+ this .node = node ;
17+ this .sum = sum ;
18+ }
19+ }
20+ 21+ class Solution {
22+ public boolean hasPathSum (TreeNode root , int sum ) {
23+ if (root == null ) return false ;
24+ LinkedList <Pair > queue = new LinkedList <>();
25+ queue .offer (new Pair (root , root .val ));
26+ 27+ while (!queue .isEmpty ()) {
28+ Pair pair = queue .poll ();
29+ if (pair .node .left == null && pair .node .right == null && pair .sum == sum ) {
30+ return true ;
31+ }
32+ if (pair .node .left != null ) {
33+ queue .offer (new Pair (pair .node .left , pair .node .left .val + pair .sum ));
34+ }
35+ if (pair .node .right != null ) {
36+ queue .offer (new Pair (pair .node .right , pair .node .right .val + pair .sum ));
37+ }
38+ }
39+ return false ;
40+ }
41+ }
0 commit comments