[LeetCode] Path Sum
LeetCode path sum
2023-09-11 14:17:25 时间
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.
递归,DFS,用stack实现还没想好怎么弄。。
1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 bool hasPathSum(TreeNode *root, int sum) { 13 14 if(root == NULL) 15 return false; 16 if(root->left == NULL && root->right == NULL) 17 { 18 if(root->val == sum) 19 return true; 20 else 21 return false; 22 } 23 bool left = false; 24 bool right= false; 25 26 if(root->left) 27 left = hasPathSum(root->left, sum - root->val); 28 if(root->right) 29 right = hasPathSum(root->right, sum - root->val); 30 31 return (left || right); 32 } 33 };
相关文章
- Leetcode: Simplify Path
- Leetcode: Path Sum II
- leetcode笔记:Ugly Number II
- module_path = DATASETS_MODULE_PATH + module_path TypeError: can only concatenate str (not “metho
- hive启动时报错 java.lang.IllegalArgumentException: java.net.URISyntaxException: Relative path in absolute URI: ${system:java.io.tmpdir%7D/$%7Bsystem:user.name%7D at org.apache.hadoop.fs.Path.initialize
- [leetcode 44] Wildcard Matching
- JS Leetcode 451. 根据字符出现频率排序题解分析
- [leetcode]面试题55 - I. 二叉树的深度
- [LeetCode] 1289. Minimum Falling Path Sum II 下降路径最小和之二
- [LeetCode] Coin Path 硬币路径
- [LeetCode] 267. Palindrome Permutation II 回文全排列之二
- [LeetCode] 64. Minimum Path Sum 最小路径和
- [LeetCode] Simplify Path 简化路径
- C#-IO-Path类-path.GetFullPath 获取上级目录实现方法
- leetcode 437. Path Sum III 路径总和 III(中等)