Path sum II |leetcode c++

最新推荐文章于 2024-06-01 06:13:38 发布

wishingweed

最新推荐文章于 2024-06-01 06:13:38 发布

阅读量467

点赞数

分类专栏： leetcode 文章标签： leetcode map path 技术

本文链接：https://blog.csdn.net/u010484308/article/details/40507261

版权

leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

I use iterate method to solve this problem.

1.I use the hash table unordered_map to record whether the node is visited.

2.i made a mistake so that the program entered an endless loop, Please see the detail information in the comment of the code.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
     vector<vector<int> > pathSum(TreeNode *root, int sum) {
     vector<vector<int>> ans;
     int sum_stack = 0;
     if(root == NULL)
     	return ans;  
     vector<int> cur(0);
     stack<TreeNode *> s;
     s.push(root);
     cur.push_back(root->val);
     sum_stack = root->val;
     unordered_map<TreeNode *,bool> visited;
     visited[root] = true;
     while(!s.empty())
     {
        TreeNode * temp = s.top();
     	if(temp->left!=NULL && !visited[temp->left])
     	{
     		s.push(temp->left);
     		cur.push_back(temp->left->val);
     		visited[temp->left] = true;
     		sum_stack +=temp->left->val;
     		continue;
     	}
     	if(temp->right != NULL && !visited[temp->right])
     	{
     		s.push(temp->right);
     		cur.push_back(temp->right->val);
     		visited[temp->right] = true;
     		sum_stack +=temp->right->val;
     		continue;
     	}
     	if(sum_stack == sum && temp->left == NULL &&temp->right == NULL)//at first I write a else after this if sentence, then 
     	//it entered an endless loop. because it excurte ans.push_back(cur) over and over;
     		ans.push_back(cur);
        sum_stack -= s.top()->val;
     	s.pop();
     	cur.pop_back();
     }
     return ans;
    }
};