Leetcode #129 Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the total sum of all root-to-leaf numbers.

For example,

    1
   / \
  2   3

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

Difficulty:Meidum

/**
 * 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:
    vector<vector<int> > ans;
    int pow2(int a, int b){
        int c = 1;
        if(a==0)
           return 0;
        if(b==0)
           return 1;
        for(int i = 0;i<b;i++)
           c = c*a;
        return c;
    }
    void input(vector<int>& nums, TreeNode* root){
        if(root==NULL)
          return;
        nums.push_back(root->val);
        if(root->left==NULL&&root->right==NULL)
           ans.push_back(nums);
        else{
            vector<int> nums1 = nums;
            input(nums,root->left);
            input(nums1,root->right);
        }
        return;
        
    }
    int sumNumbers(TreeNode* root) {
        vector<int> nums;
        input(nums,root);
        int len = ans.size();
        int ans2 = 0;
        if(len==0)
           return 0;
        for(int i = 0;i<len;i++){
            for(int j = 0;j<ans[i].size();j++)
            {
                ans2 = ans2 + pow2(10,ans[i].size()-1-j) * ans[i][j];
            }
        }
        return ans2;
    }
};