/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void diGui(TreeNode *t, int &sum, bool isLeft)
{
if (t->left)
{
diGui(t->left, sum, true);
}
if (t->right)
{
diGui(t->right, sum, false);
}
if (!t->left && !t->right && isLeft == true)
{
sum += t->val;
}
}
int sumOfLeftLeaves(TreeNode* root) {
int sum = 0;
if (root) diGui(root, sum, false);
return sum;
}
};
注意它是求左叶子之和,一开始写成左节点了
就很简单写了个递归,用一个bool判断它是不是左子树。注意sum传的引用,太好用了!