Leetcode NO.113 Path Sum II

最新推荐文章于 2024-10-05 11:02:16 发布

lym1108csu

最新推荐文章于 2024-10-05 11:02:16 发布

阅读量406

点赞数

分类专栏： Leetcode 文章标签： Tree vector 算法 leetcode dfs

本文链接：https://blog.csdn.net/u012290414/article/details/43430259

版权

Leetcode 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

本题题目要求如下：

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree and sum = 22 ,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1

return

[
   [5,4,11,2],
   [5,8,4,5]
]

本题没什么太多的巧妙思路。。很直接，就是直接用dfs算法解决，如果遍历到leaf node正好和为sum，则将此值插入到返回的vector中

代码如下：

/**
 * 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) {

        if (root == NULL)
        	return retVal;
        vector<int> tmp;
        dfs(root, sum, tmp);

        return retVal;
    }
private:

	vector<vector<int>> retVal;
	
	void dfs(TreeNode* root, int sum, vector<int> &tmp) {
		
		tmp.push_back(root->val);
		if (root->left == NULL && root->right == NULL) {
			if (sum == root->val)
				retVal.push_back(tmp);
		}
		else {
			if (root->left != NULL)
				dfs(root->left, sum-root->val, tmp);
			if (root->right != NULL)
				dfs(root->right, sum-root->val, tmp);
		}
		tmp.pop_back();
	}
};