LeetCode-Path Sum

最新推荐文章于 2019-05-12 19:33:21 发布

数据探险家

最新推荐文章于 2019-05-12 19:33:21 发布

阅读量764

点赞数

分类专栏： LeetCode OJ 文章标签： LeetCode

本文链接：https://blog.csdn.net/xin_jmail/article/details/38983071

版权

LeetCode OJ 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

题目：https://oj.leetcode.com/problems/path-sum/

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.

源码：Java版本

算法分析：时间复杂度O(n)，空间复杂度O(logn)。

public 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);
    }
}