LeetCode-Solutions/129.sum-root-to-leaf-numbers.cpp at main · dec0deit/LeetCode-Solutions · GitHub

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
/*
 * @lc app=leetcode id=129 lang=cpp
 *
 * [129] Sum Root to Leaf Numbers
 */

// @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:
    int sum = 0;
    int sumNumbersUtil(TreeNode* root,int value){
        if(root == nullptr){
            return 0;
        }

        value = value*10+root->val;

        if(root->left == nullptr && root->right==nullptr){
            return value;
        }

        return sumNumbersUtil(root->left, value)+sumNumbersUtil(root->right, value);
    }

    int sumNumbers(TreeNode* root) {
        return sumNumbersUtil(root, 0);
    }
};
// @lc code=end