力扣刷题记录49.1-----112. 路径总和

---

一、题目

二、代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    //递归三要素:
    //1.参数的返回值
    //2.终止条件
    //3.处理逻辑
    
    void traversal(TreeNode* cur,vector<int>&path,vector<int>&result)
    {
      path.push_back(cur->val);  //压入vector 用于后期回溯
      
      if(cur->left==nullptr&&cur->right==nullptr)  //到了子叶节点 计算总和
      {
          int i;
          int temp_result=0;
          for(i=0;i<path.size();i++)
          {
            temp_result+=path[i];
          }
          std::cout<<"  temp _ result"<<temp_result<<std::endl;
          result.push_back(temp_result);    
      }
      
      if(cur->left)
      {
        traversal(cur->left,path,result);
        path.pop_back();  //这里体现了回溯的思想
      }

      if(cur->right)
      {
        traversal(cur->right,path,result);
        path.pop_back();  //这里体现了回溯的思想
      }



    }
    bool hasPathSum(TreeNode* root, int targetSum) 
    {
       bool return_bool=0;
       vector<int>path;
       vector<int>result;
       vector<int>::iterator it;

       if(root!=nullptr)  traversal(root,path,result);
    
       for(it=result.begin();it!=result.end();it++)
       {
           std::cout<<"  "<<*it;
       }
       std::cout<<std::endl;
    

       it=find(result.begin(),result.end(),targetSum);
       if(it!=result.end()) return_bool=1;

       return return_bool;
    }
};

三、运行结果