题目:
思路1:迭代
迭代:
用两个队列来维护整个过程,一个存节点,一个存路径和,同步进出队列
当为叶子节点时,判断当前路径总和是否符合要求
队列为空时,遍历结束
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
//两个队列来维护
class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
Deque<TreeNode> node_deque = new LinkedList<TreeNode>();
Deque<Integer> ans_deque = new LinkedList<Integer>();
if(root == null)
return false;
node_deque.offer(root);
ans_deque.offer(root.val);
while(!node_deque.isEmpty()){//队列不为空时
TreeNode node = node_deque.poll();
int temp_sum = ans_deque.poll();
if(node.left == null && node.right == null){//当前节点为叶子节点
if(temp_sum == sum)
return true;
continue;
}
if(node.left != null){
node_deque.offer(node.left);
ans_deque.offer(node.left.val + temp_sum);
}
if(node.right != null){
node_deque.offer(node.right);
ans_deque.offer(node.right.val + temp_sum);
}
}
return false;
}
}
复杂度分析:
时间复杂度:O(n)
空间复杂度:O(n)
思路2:递归☆☆☆☆☆☆
用减法来求解路径和的问题
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null)
return false;
if(root.left == null && root.right == null){//判断是否是叶子节点
return sum == root.val;
}
return hasPathSum(root.left,sum - root.val) || hasPathSum(root.right,sum - root.val);
}
}
复杂度分析:
时间复杂度:O(n)
空间复杂度:O(n)