leetcode/129.cpp at master · shuest/leetcode · 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
41
42
43
44
45
46
47
48
49
50


#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;

  struct TreeNode {
      int val;
     TreeNode *left;
     TreeNode *right;
     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 };

class Solution {
public:
    int sumNumbers(TreeNode* root) {
        dfs(root);
		return res;
    }
private:
	int res=0;
	void dfs(TreeNode* root)
	{
		if(root ==NULL)
			return;
		if(root->left==NULL&&root->right==NULL)
		{
			res+=root->val;
			return;
		}
		if(root->left!=NULL)
		{
			root->left->val+=root->val*10;
			dfs(root->left);
		}
		if(root->right!=NULL)
		{
			root->right->val+=root->val*10;
			dfs(root->right);
		}
	}
};