Leetcode 129. Sum Root to Leaf Numbers | | Leetcode 129. Sum Root to Leaf Numbers 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314151617181920212223242526272829303132333435/** * 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 sumNumbers(TreeNode* root) { if(!root) { return 0; } int sum = 0; traverseSum(root, sum, 0); return sum; }private: void traverseSum(TreeNode* root, int& sum, int current) { current = current * 10 + root->val; if(!root->left && !root->right) { sum += current; return; } if(root->left) { traverseSum(root->left, sum, current); } if(root->right) { traverseSum(root->right, sum, current); } }}; Reference https://leetcode.com/problems/sum-root-to-leaf-numbers/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏