Path Sum II

最新推荐文章于 2024-10-26 02:26:14 发布

顺其自然__

最新推荐文章于 2024-10-26 02:26:14 发布

阅读量271

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 题目

本文链接：https://blog.youkuaiyun.com/JSRGFJZ/article/details/49157051

Leetcode 题目专栏收录该内容

110 篇文章

订阅专栏

题目：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

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

思路：回溯

代码：

class Solution {
//https://leetcode.com/problems/path-sum-ii/
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<int> temp;
        vector< vector<int> >result;
        pathSumHelper(root,sum,temp,result);
        return result;
        //好久时间
    }
    
    void pathSumHelper(TreeNode *root,int sum,vector<int> &temp,vector<vector<int> >&result){
        if(root==NULL){
            return;
        }
        temp.push_back(root->val);
        if(root->left==NULL&&root->right==NULL&&root->val==sum){
            result.push_back(temp);
        }
        pathSumHelper(root->left,sum - root->val,temp,result);
        pathSumHelper(root->right,sum - root->val,temp,result);
        
        temp.pop_back();
    }
};