algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #107 from Joshua-Lu/patch-24

Browse Source 
更新 0112.路径总和 Java版本
This commit is contained in:
Carl Sun
2021-05-14 10:40:50 +08:00
committed by GitHub
parent 8cd10d3d25 36b861490a
commit b7380a247d
1 changed files with 23 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
problems/0112.路径总和.md
View File

@ -305,25 +305,34 @@ public:
Java：
```java
```Java
class Solution {
private boolean flag = false;
public boolean hasPathSum(TreeNode root, int targetSum) {
has_2(root,targetSum);
return flag;
}
public void has_2 (TreeNode root, int count) {
if (root == null) return;
if (root.left == null && root.right == null && count == root.val) {
flag = true;
public boolean hasPathSum(TreeNode root, int targetSum) {
if (root == null) {
return false;
}
if (root.left != null) has_2(root.left,count - root.val);
if (root.right != null) has_2(root.right,count - root.val);
targetSum -= root.val;
// 叶子结点
if (root.left == null && root.right == null) {
return targetSum == 0;
}
if (root.left != null) {
boolean left = hasPathSum(root.left, targetSum);
if (left) {// 已经找到
return true;
}
}
if (root.right != null) {
boolean right = hasPathSum(root.right, targetSum);
if (right) {// 已经找到
return true;
}
}
return false;
}
}
```
```
Python：