树-路径和的迭代写法和递归写法

一、迭代写法

队列1：存放当前遍历到的节点；
队列2：对应队列1存放的节点的路径和；
cur ：队列1取出来的当前节点
temp：队列2取出来的，队列1当前节点的路径和；

import java.util.LinkedList;
import java.util.Queue;

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    // 构造函数
    TreeNode() {}
    TreeNode(int val)
    { this.val = val; }

    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

class Solution {
    public boolean hasPathSum(TreeNode root, int sum){
        Queue<TreeNode> queueTreenode = new LinkedList<>();
        Queue<Integer> queueSum = new LinkedList<>();
        queueTreenode.offer(root);
        queueSum.offer(root.val);
        TreeNode cur;
        // 存放到当前节点为止的和
        int temp;
        while (!queueTreenode.isEmpty()){
            cur = queueTreenode.poll();
            temp = queueSum.poll();
            // 当前节点为叶子节点时
            if(cur.left == null && cur.right == null){
                if(temp == sum)return true;
            }
            // 当前节点非叶子节点时
            if(cur.left != null){
                queueTreenode.offer(cur.left);
                queueSum.offer(cur.left.val + temp);
            }
            if(cur.right != null){
                queueTreenode.offer(cur.right);
                queueSum.offer(cur.right.val + temp);
            }
        }
        return false;
    }
}

class test{
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);
        TreeNode node7 = new TreeNode(7);
        node1.left = node2;node1.right = node3;
        node2.left = node4;node2.right = node5;
        node3.left = node6;node3.right = node7;
        System.out.println(new Solution().hasPathSum(node1,7));
    }
}

二、递归写法

class Solution{
    public boolean hasPathSum(TreeNode root, int sum){

        return judge(root,sum);
    }

    public boolean judge(TreeNode root,int num){
        if (root == null)return false;
        if(root.left == null && root.right == null){
            if(root.val == num)return true;
            else return false;
        }
        // root 左右子树有一个为真则返回真
//        if(root.left != null){
//            return judge(root.left, num - root.val);
//        }
//        if(root.right != null){
//            return judge(root.right,num - root.val);
//        }
        return (judge(root.left, num - root.val) || judge(root.right,num - root.val));
    }
}