【刷题】Leetcode 494. Target Sum

最新推荐文章于 2024-04-11 13:22:50 发布

鸡蛋豆腐仙子

最新推荐文章于 2024-04-11 13:22:50 发布

阅读量63

点赞数

分类专栏：刷题 # DFS 文章标签：数据结构

本文链接：https://blog.csdn.net/qq_19450921/article/details/103447567

版权

刷题同时被 2 个专栏收录

50 篇文章 0 订阅

订阅专栏

DFS

13 篇文章 0 订阅

订阅专栏

Example 1:
Input: nums is [1, 1, 1, 1, 1], S is 3.
Output: 5
Explanation:

-1+1+1+1+1 = 3
+1-1+1+1+1 = 3
+1+1-1+1+1 = 3
+1+1+1-1+1 = 3
+1+1+1+1-1 = 3

There are 5 ways to assign symbols to make the sum of nums be target 3.
我可以独立作出leetcode的题了，哈哈哈，值得纪念

class Solution {
    int count = 0;
    public int findTargetSumWays(int[] nums, int S) {
        int length = nums.length;
        int sum = 0;
        helper(nums, S, sum, 0);
        return count;
    }
    
    public void helper(int[] nums, int S, int sum, int d){
        if(d == nums.length){
            if(sum == S)
                count++;
            sum = S - nums[d - 1];
            return;
        }
        helper(nums, S, sum + nums[d], d + 1);
        helper(nums, S, sum - nums[d], d + 1);
        
    }
}