113. Path Sum II

遍历所有的路径 并将遍历的路径保存下来 遍历到叶子节点的时候 将满足条件的路径加入ret中 最后返回.

/**
 * 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 {
private:
    vector<vector<int>> ret;
    void traverse(TreeNode *root,int pre,vector<int> element,int sum)
    {
        if(root)
        {
            int thislevel=pre+root->val;
            element.push_back(root->val);
            if(!root->left&&!root->right&&thislevel==sum)
            {
                ret.push_back(element);
            }
            else if(root->left&&root->right)
            {
                traverse(root->left,thislevel,element,sum);
                traverse(root->right,thislevel,element,sum);
            }
            else if(root->left)
            {
                traverse(root->left,thislevel,element,sum);
            }
            else 
                traverse(root->right,thislevel,element,sum);
        }
    }
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<int> element;
        traverse(root,0,element,sum);
        return ret;
    }
};