494. 目标和

Python ml

已于 2023-02-23 16:30:02 修改

阅读量50

点赞数

分类专栏： LeetCode 文章标签：深度优先算法 leetcode

于 2023-02-23 15:15:40 首次发布

本文链接：https://blog.csdn.net/m0_48711099/article/details/129182403

版权

LeetCode 专栏收录该内容

165 篇文章 0 订阅

订阅专栏

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

dp 背包问题
在这里插入图片描述

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int target) {
        int sum =accumulate(nums.begin(),nums.end(),0);
        if(abs(target)>sum) return 0;
        int len =nums.size(),t=2*sum+1;
        vector<vector<int>> dp(len,vector<int>(t,0));
        dp[0][sum+nums[0]]++;
        dp[0][sum-nums[0]]++;
        int temp_boundary = nums[0];
        for(int i=1;i<len;++i){
            temp_boundary+=nums[i];
            for(int j=sum-temp_boundary;j<=sum + temp_boundary;++j){
                int L = j-nums[i]>=0? dp[i-1][j-nums[i]]:0;
                int R = j+nums[i]<t? dp[i-1][j+nums[i]]:0;
                dp[i][j] = L+R;
            }
        }
        return dp[len-1][sum+target];
    }
};