二叉树的路径和

给定一个二叉树，找出所有路径中各节点相加总和等于给定 目标值 的路径。

一个有效的路径，指的是从根节点到叶节点的路径。

样例

样例1:

输入:
{1,2,4,2,3}
5
输出: [[1, 2, 2],[1, 4]]
说明:
这棵树如下图所示：
	     1
	    / \
	   2   4
	  / \
	 2   3
对于目标总和为5，很显然1 + 2 + 2 = 1 + 4 = 5

样例2:

输入:
{1,2,4,2,3}
3
输出: []
说明:
这棵树如下图所示：
	     1
	    / \
	   2   4
	  / \
	 2   3
注意到题目要求我们寻找从根节点到叶子节点的路径。
1 + 2 + 2 = 5, 1 + 2 + 3 = 6, 1 + 4 = 5 
这里没有合法的路径满足和等于3.

 

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */


class Solution {
public:
    /*
     * @param root: the root of binary tree
     * @param target: An integer
     * @return: all valid paths
     */
    vector<vector<int>> binaryTreePathSum(TreeNode * root, int sum1) {
        // write your code here
    
        vector<vector<int>> ret;
        if(root == NULL)
        {
            return ret;
        }
        TreeNode* p = root;
        TreeNode* r;
        int sum = 0;
        bool flag;
        stack<TreeNode*> s1;
        stack<TreeNode*> s2;
        do
        {
            while(p != NULL)
            {
                s1.push(p);
                s2.push(p);
                p = p->left;
            }  //找到最左下角的节点,这个节点没有左子树
           
            r = NULL;
            flag = true;

            
            while(!s1.empty() && flag)
            {
                p = s1.top();
                if(p->right == r)
                {
                    if(p->left == NULL && p->right == NULL)     //叶子节点
                    {

                        int numtmp = 0;
                        vector<int> mytmp;
                        for(int i = 0; i<s1.size(); i++)
                        {

                            TreeNode* tmp = s2.top();
                            

                            numtmp = numtmp + (tmp->val);
                            mytmp.insert(mytmp.begin(),tmp->val);
                            s2.pop();
                        }
                        if(numtmp == sum1)
                        {
                            ret.push_back(mytmp);
                        }
                            
     
                        
                    }
                    s2 =s1;
                    p = s1.top();
                    r = p;
                    s1.pop();
                    s2.pop();
                    
                    
                }
                else
                {
                     p = p->right;
                     flag = false;
                }
                
            }
           
            
        }while(!s1.empty());
        
        return ret;
    
    }
};