LeetCode | 494. Target Sum

最新推荐文章于 2024-10-16 00:00:43 发布

1LOVESJohnny

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量130

点赞数

分类专栏： LeetCode 文章标签：算法 C++ leetcode

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/121645216

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题目

ou are given an integer array nums and an integer target.

You want to build an expression out of nums by adding one of the symbols ‘+’ and ‘-’ before each integer in nums and then concatenate all the integers.

For example, if nums = [2, 1], you can add a ‘+’ before 2 and a ‘-’ before 1 and concatenate them to build the expression “+2-1”.
Return the number of different expressions that you can build, which evaluates to target.

Example 1:

Input: nums = [1,1,1,1,1], target = 3
Output: 5
** Explanation:** There are 5 ways to assign symbols to make the sum of nums be target 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
+1 + 1 + 1 + 1 - 1 = 3

Example 2:

Input: nums = [1], target = 1
Output: 1

Constraints:

1 <= nums.length <= 20
0 <= nums[i] <= 1000
0 <= sum(nums[i]) <= 1000
-1000 <= target <= 1000

代码

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int S) {
        if(accumulate(nums.begin(), nums.end(), 0)<S)
            return 0;
        
        int ofs = 2017;
        vector<vector<int>> dp(2, vector<int>(S+ofs*2+5));
		
		dp[0][ofs+nums[0]] = dp[0][ofs-nums[0]] = 1;
		for(int i = 1; i<nums.size(); i++){
			for(int j=-1000; j<=S+1000; j++){
				int idx = i%2;
				int before = (idx+1)%2;
				dp[idx][j+ofs] = dp[before][j-nums[i]+ofs] + dp[before][j+nums[i]+ofs];
			}
		}
		
		return nums[0]==0 ? dp[(nums.size()-1)%2][S+ofs]*2:dp[(nums.size()-1)%2][S+ofs];
    }
};