-
Notifications
You must be signed in to change notification settings - Fork 1
/
112.路径总和.cpp
43 lines (43 loc) · 1.29 KB
/
112.路径总和.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
/*
* @lc app=leetcode.cn id=112 lang=cpp
*
* [112] 路径总和
*/
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right)
: val(x), left(left), right(right) {}
};
// @lc code=start
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left),
* right(right) {}
* };
*/
class Solution {
public:
bool hasPathSum(TreeNode *root, int targetSum) {
if (root == nullptr)
return false;
if (root->left == nullptr && root->right == nullptr)
return root->val == targetSum;
if (root->left != nullptr && root->right == nullptr)
return hasPathSum(root->left, targetSum - root->val);
if (root->left == nullptr && root->right != nullptr)
return hasPathSum(root->right, targetSum - root->val);
return hasPathSum(root->left, targetSum - root->val) ||
hasPathSum(root->right, targetSum - root->val);
}
};
// @lc code=end