0494.目标和 回溯算法你写得不好，这么写不会超时

[liyunlongaaa]

class Solution { public: int ans = 0; void dfs(vector<int> &nums, int target, int curSum, int Idx, int len) { if (Idx == len) { if (curSum == target) ans++; return ; } dfs(nums, target, curSum + nums[Idx], Idx + 1, len); dfs(nums, target, curSum - nums[Idx], Idx + 1, len); } int findTargetSumWays(vector<int>& nums, int target) { int len = nums.size(); dfs(nums, target, 0, 0, len); return ans; } };

[LightSeekr]

用下 md 文档吧，这样，也看不出来

[0ws0]

这是啥呀？