zoukankan      html  css  js  c++  java
  • Path Sum 解答

    Question

    Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

    For 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.

    Solution 1 -- Recursion

     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 public class Solution {
    11     public boolean hasPathSum(TreeNode root, int sum) {
    12         if (root == null)
    13             return false;
    14         int total = 0;
    15         return dfs(root, sum, total);
    16     }
    17     
    18     private boolean dfs(TreeNode root, int target, int prevSum) {
    19         if (root == null)
    20             return false;
    21         int currentSum = prevSum + root.val;
    22         if (root.left == null && root.right == null) {
    23             return currentSum == target;
    24         } else {
    25             return (dfs(root.left, target, currentSum) || dfs(root.right, target, currentSum));
    26         }
    27             
    28     }
    29 }

    Solution 2 -- BFS

    We can use two stacks here. One to record tree nodes. And the other to record current path sum from root to this node. Since we traverse the tree level by level. It's BFS.

     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 public class Solution {
    11     public boolean hasPathSum(TreeNode root, int sum) {
    12         if (root == null)
    13             return false;
    14         Stack<TreeNode> stack1 = new Stack<TreeNode>();
    15         Stack<Integer> stack2 = new Stack<Integer>();
    16         stack1.push(root);
    17         stack2.push(0);
    18         while (!stack1.empty()) {
    19             TreeNode currentNode = stack1.pop();
    20             int currentSum = stack2.pop() + currentNode.val;
    21             if (currentNode.left == null && currentNode.right == null && currentSum == sum)
    22                 return true;
    23             if (currentNode.left != null) {
    24                 stack1.push(currentNode.left);
    25                 stack2.push(currentSum);
    26             }
    27             if (currentNode.right != null) {
    28                 stack1.push(currentNode.right);
    29                 stack2.push(currentSum);
    30             }
    31         }
    32         return false;
    33     }
    34 }
  • 相关阅读:
    OGRE源代码resource分析
    全排列
    各种让人无语的库
    python Kmeans算法
    Linux服务器安装MariaDB数据库
    初探SEO,BSP收录速度测试
    MetaWeblog API调用
    Patterns
    腾讯。。。对Linux的支持程度直接扼杀了Linux在国内用户群的增长
    个人电子商务网站建设之——整站静态化实现的选择、设计与实现(二):静态页面的实现方式;
  • 原文地址:https://www.cnblogs.com/ireneyanglan/p/4850494.html
Copyright © 2011-2022 走看看