leetcode 404. Sum of Left Leaves

来源：互联网发布：承接大数据项目外包编辑：程序博客网时间：2024/05/02 23:15

/** * 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:    int ans;    void dfs(TreeNode * root,int l){        if(root == NULL) return;        if(root->left == NULL && root->right == NULL){            if(l == 1) ans += root->val;            return ;        }        dfs(root->left,1);        dfs(root->right,0);    }    int sumOfLeftLeaves(TreeNode* root) {        ans = 0;         dfs(root,0);         return ans;    }};

0 0

LeetCode笔记：404. Sum of Left Leaves
【leetcode】404. Sum of Left Leaves【E】
LeetCode—404. Sum of Left Leaves
[LeetCode]404. Sum of Left Leaves
Leetcode 404. Sum of Left Leaves
LeetCode 404. Sum of Left Leaves
404. Sum of Left Leaves - leetcode
[LeetCode]--404. Sum of Left Leaves
LeetCode 404. Sum of Left Leaves
[leetcode]404. Sum of Left Leaves
LeetCode-404. Sum of Left Leaves
LeetCode 404. Sum of Left Leaves
LeetCode 404. Sum of Left Leaves
leetcode 404. Sum of Left Leaves
leetcode(88).404. Sum of Left Leaves
【LeetCode】 404. Sum of Left Leaves
leetcode 404. Sum of Left Leaves
[Leetcode]404. Sum of Left Leaves
C++创建一个新的进程
Java并发编程
MongoDB(四)聚合
HDU2041_超级楼梯
深入理解PHP7之zval
leetcode 404. Sum of Left Leaves
hibernate inverse
SpringIoc中的注入详解
Android Studio发布项目到Jcenter
深入浅出JMS(四)--Spring和ActiveMQ整合的完整实例
POJ 3041 Asteroids(二分图）
2016.11.23
第十三周项目3-Dijkstra算法的验证
第十三周项目四 Floyd算法的验证