LeetCode 129 Sum Root to Leaf Numbers

LeetCode 129

Sum Root to Leaf Numbers

• Problem Description：
  二叉树每个节点值都是0-9中的一个整数，从二叉树的根节点遍历到叶节点的路径中各节点值组成一个数，如路径为1-2-3，组成的数为123。题目要求计算这些数的和。

  具体的题目信息：
  https://leetcode.com/problems/sum-root-to-leaf-numbers/description/

• Example:
  
• Solution:
  
  • 解题思路：本题可直接用非递归后序遍历来实现。
  • 编程实现：

/**
 * 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 == NULL) return 0;
        vector<int> num;
        int sum = 0;
        TreeNode* cur = root;
        TreeNode* pre = NULL;
        stack<TreeNode*> node;
        while(cur || !node.empty()) {
            while(cur) {
                node.push(cur);
                sum  = 10*sum+cur->val;
                cur = cur->left;
            }
            cur = node.top();
            if (cur->left == NULL && cur->right == NULL) {
                num.push_back(sum);
            }
            if (cur->right && cur->right != pre) {
                cur = cur->right;
            } else {
                pre = cur;
                cur = NULL;
                sum = (sum-node.top()->val)/10;
                node.pop();
            }
        }
        sum = 0;
        for (int i = 0; i < num.size(); i++) {
            sum += num[i];
        }
        return sum;
    }
};