Leetcode/129.cpp at master · JarvisZhang/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
//
//  129.cpp
//  LeetCode
//
//  Created by 张佐玮 on 15/7/8.
//  Copyright (c) 2015年 JarvisZhang. All rights reserved.
//
//  Title: Sum Root to Leaf Numbers
//

#include <iostream>
#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) {
        int result = 0;
        queue<TreeNode*> nodes;
        if (root != NULL) {
            nodes.push(root);
        }
        while (!nodes.empty()) {
            TreeNode* node = nodes.front();
            if (!node -> left && !node -> right) {
                result += node -> val;
            }
            if (node -> left) {
                node -> left -> val += node -> val * 10;
                nodes.push(node -> left);
            }
            if (node -> right) {
                node -> right -> val += node -> val * 10;
                nodes.push(node -> right);
            }
            nodes.pop();
        }
        return result;
    }
};