題目

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.

代碼

/*** Definition for binary tree* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/ public class Solution {boolean flag=false;public boolean hasPathSum(TreeNode root, int sum) {if(root==null) return flag;isTrue(root,sum);return flag;}public void isTrue(TreeNode root, int sum){if(root==null) return;if(root.right==null && root.left==null && sum-root.val==0) flag=true;else {isTrue(root.left,sum-root.val);isTrue(root.right,sum-root.val);}}}

/********************************

* 本文來自博客 ?“李博Garvin“

* 轉載請標明出處:http://blog.csdn.net/buptgshengod

******************************************/

總結

以上是生活随笔為你收集整理的【LeetCode从零单排】No112Path Sum的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。