力扣-494题 目标和（C++）- 回溯

题目链接：https://leetcode.cn/problems/target-sum/
题目如下：


解法一：回溯

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int target) {
        backtracking(nums,target,0,0);
        return res;
    }
    void backtracking(vector<int>& nums,int target,int startIndex,int sum){
        if(startIndex==nums.size()){
            if(sum==target) res++;
            return ;
        }
        //回溯
        backtracking(nums,target,startIndex+1,sum+nums[startIndex]);//+num
        backtracking(nums,target,startIndex+1,sum-nums[startIndex]);//-num
    }

private:
    int res=0;
};