[LeetCode] Target Sum通过添加+/-获得目标结果
来源:互联网 发布:软件开发咨询 编辑:程序博客网 时间:2024/05/18 13:44
声明:原题目转载自LeetCode,解答部分为原创
Problem :
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols +
and -
. For each integer, you should choose one from +
and -
as its new symbol.
Find out how many ways to assign symbols to make sum of integers equal to target S.
Example 1:
Input: nums is [1, 1, 1, 1, 1], S is 3. Output: 5Explanation: -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 = 3There are 5 ways to assign symbols to make the sum of nums be target 3.
Note:
- The length of the given array is positive and will not exceed 20.
- The sum of elements in the given array will not exceed 1000.
- Your output answer is guaranteed to be fitted in a 32-bit integer.
思路:动态规划类型。通过给数组的每个数值添加+/-符号,可以将数组分为两个部分,分别是正数组pos[ ]和负数组neg[ ],目标结果为:
target = sum_of_pos - sum_of_neg
target = sum_of_pos - (sum_of_array - sum_of_pos)
target = 2 * sum_of_pos - sum_of_array
通过以上推导,我们可以将题意转化成我们比较熟悉的类型,即求解和为某定值的子集的个数。在本题中,对应的目标和指的是sum_of_pos。
求解和为某定值的子集的个数,详见另一篇文章“[LeetCode] Partition Equal Subset Sum划分数组形成两个和相等的子集”。
代码如下:
#include<iostream>#include<vector>using namespace std;class Solution {public: int findTargetSumWays(vector<int>& nums, int s) { int sum = 0;for(int i = 0 ; i < nums.size() ; i ++){sum += nums[i];}if(sum < s)return 0;else if((sum + s) % 2 != 0)return 0;elsereturn count(nums, (sum + s) / 2); } int count(vector<int>& nums, int target) { if(nums.size() == 0) return 0; vector<int> count_of_sum(target + 1, 0); count_of_sum[0] = 1; for(int i = 0 ; i < nums.size() ; i++) { int add = nums[i]; for(int j = target; j >= add; j --) { count_of_sum[j] += count_of_sum[j - add];}}return count_of_sum[target]; }};int main(){Solution text;vector<int> nums(8,1);cout << text.findTargetSumWays(nums, 4) << endl;return 0;}
- [LeetCode] Target Sum通过添加+/-获得目标结果
- LeetCode-494. Target Sum (JAVA) (目标和)
- LeetCode 494. Target Sum
- [LeetCode]494. Target Sum
- [leetcode]494. Target Sum
- Leetcode 494. Target Sum
- LeetCode: Target Sum
- leetcode[494]:Target Sum
- leetCode---Target Sum
- Leetcode-494. Target Sum
- LeetCode 494:Target Sum
- leetcode 494 Target sum
- Leetcode 494. Target Sum
- leetcode-494. Target Sum
- [LeetCode OJ]Target Sum
- leetcode:494. Target Sum
- (LeetCode) 494. Target Sum
- LeetCode 494. Target Sum
- HDFS命令行客户端使用,命令行客户端支持的命令参数,常用命令参数介绍
- spring_SSH整合之_OpenSessionInView
- Android 线程模型和Looper深入理解
- javascript中的this---you don't know js学习笔记(一)
- Android统计图表MPAndroidChart
- [LeetCode] Target Sum通过添加+/-获得目标结果
- Codeforces Educational Round#21 F(808F) Solution:网络流(最小割)
- 生活随笔:人脉网、管理人、看人、投资
- 什么是算法,为什么需要学算法,以及算法学到什么程度
- leetcode 40. Combination Sum II
- 一个IT人士的个人经历,给迷失方向的朋友
- Python中列表的copy方法
- Linux之线程的创建、等待、终止及分离
- ES 其他公司使用参考