算法设计与分析（十二）--动态规划

Target Sum

题目

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: 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.

分析

这里一看起来好像很复杂的样子，因为对于每个元素，有加号和减号两种情况，所以很难处理这两种情况，但我们可以将题目进行一定的转化，过程如下，P代表取加号的元素，而N代表取减号的情况。
转化情况如下：
sum（P）- sum(N) = S;
sum(P&