Leetcode 494. 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.
DFS： 方法
package DP;

/**
 * Created by hzdmm on 2017/4/17.
 */
public class TargetSum_494 {
    public int result;
    public int findTargetSumWays(int[] nums, int S) {
        dfs(0,0,S,nums);
        return result;
    }

    public void dfs(int sum,int index,int S,int[] nums){
        if (index==nums.length){//边界条件
            if (sum==S){
                result++;//处理结果
            }
            return;
        }
        dfs(sum+nums[index],index+1,S,nums);
        dfs(sum-nums[index],index+1,S,nums);
    }
}
DP 方法