112. Path Sum
来源:互联网 发布:linux 查看隐藏文件 编辑:程序博客网 时间:2024/06/01 21:55
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.
Subscribe to see which companies asked this question
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public boolean hasPathSum(TreeNode root, int sum) { if(root==null)return false; if(root.val==sum&&root.right==null&&root.left==null)return true; // if(root.val>sum)return false; return (hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val)); }}
0 0
- 112. Path Sum && 113. Path Sum II
- 112. Path Sum&113. Path Sum II
- 112.Path Sum
- LeetCode 112. Path Sum
- [LeetCode]112.Path Sum
- 【LeetCode】112.Path Sum
- [Leetcode] 112. Path Sum
- [leetcode] 112.Path Sum
- 112.Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum LeetCode
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- Problem C: 判断字符串是否为回文
- 9. Palindrome Number
- au3 调用 炫彩例子学习
- 自适应布局
- 简单脱壳教程笔记(4)---手脱ASPACK壳
- 112. Path Sum
- 《经济学》--曼昆
- POJ1088滑雪
- SDUT_3501_超简单题四
- 111. Minimum Depth of Binary Tree
- 深入理解Android的RPC方式与AIDL
- Exynos4412 中断驱动开发相关问题总结
- 160. Intersection of Two Linked Lists
- Android窗口显示:全屏与隐藏标题栏