leetcode_113题——Path Sum II（深度优先搜索）

#include<iostream>
#include<stack>
#include<utility>
#include<vector>
using namespace std;

struct TreeNode {
	     int val;
	     TreeNode *left;
	     TreeNode *right;
	     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
	 };

vector<vector<int> > pathSum(TreeNode *root, int sum) 
{
	vector<vector<int> > result;
	if(root==NULL)
		return result;

	stack<pair<TreeNode*,vector<int> > > sta_temp;
	vector<int> temp;
	temp.push_back(root->val);
	sta_temp.push(make_pair(root,temp));

	vector<int> Vtemp_top;
	TreeNode* Ttemp_top;

	while(!sta_temp.empty())
	{
		Vtemp_top=sta_temp.top().second;
		Ttemp_top=sta_temp.top().first;

		sta_temp.pop();

		if(Ttemp_top->left==NULL&&Ttemp_top->right==NULL)
		{
			int sum_temp=0;
			for(int i=0;i!=Vtemp_top.size();i++)
			{
				sum_temp+=Vtemp_top[i];
			}
			if(sum_temp==sum)
				{
					result.push_back(Vtemp_top);
			    }
	     }
		if(Ttemp_top->left!=NULL)
		{
			Vtemp_top.push_back(Ttemp_top->left->val);
			sta_temp.push(make_pair(Ttemp_top->left,Vtemp_top));
			Vtemp_top.pop_back();
		}
		if(Ttemp_top->right!=NULL)
		{
			Vtemp_top.push_back(Ttemp_top->right->val);
			sta_temp.push(make_pair(Ttemp_top->right,Vtemp_top));
			//temp.pop_back();
		}
     }
	return result;
}

int main()
{
	TreeNode* root=(TreeNode*)malloc(sizeof(TreeNode));
	root->val=1;
	root->right=NULL;
	root->left=(TreeNode*)malloc(sizeof(TreeNode));
	root->left->val=2;
	root->left->left=NULL;
	root->left->right=NULL;

	vector<vector<int> > temp;
	temp=pathSum(root,1);
}