leetcode | 112. Path Sum(递归&&迭代)

Problem

https://leetcode.com/problems/path-sum/
Example:

Given the below binary tree and sum = 22,
5
/
4 8
/ /
11 13 4
/ \
7 2 1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

Solution1

参见 https://leetcode.com/problems/path-sum/solution/

• 递归
• time: O(n)
• space: average O(log(n)) worst O(n)

    public boolean hasPathSum(TreeNode root, int sum) {
        if(root==null) return false;
        if(root.left==null&&root.right==null) return root.val == sum;
        return hasPathSum(root.left, sum - root.val) ||  hasPathSum(root.right, sum - root.val);
    }

Solution2

• 迭代，dfs
• time: O(n)
• space: average O(log(n)) worst O(n)

public boolean hasPathSum(TreeNode root, int sum) {
        if(root==null) return false;
        LinkedList<TreeNode> node_stack = new LinkedList();
        LinkedList<Integer> sum_stack = new LinkedList();
        node_stack.add(root);
        sum_stack.add(sum - root.val);
        while(!node_stack.isEmpty()){
            TreeNode node = node_stack.pollLast();
            int tmp = sum_stack.pollLast();
            if(node.left==null&&node.right==null&&tmp==0) return true;
            if(node.left!=null){
                node_stack.add(node.left);
                sum_stack.add(tmp - node.left.val);
            }
            if(node.right!=null){
                node_stack.add(node.right);
                sum_stack.add(tmp - node.right.val);
            }
        }
        return false;
    }