human
I found an interesting problem on https://leetcode.com/problems/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.


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.

I tried it in Python, but could not do it. Can you solve it?

=====
Give me a Python program to find out how many ways to assign symbols to make sum of integers equal to target S?
assistant
#Here is Python program to find out how many ways to assign symbols to make sum of integers equal to target S.

class Solution:
     def findTargetSumWays(self, nums, S):
         sum_ = sum(nums)
         if S > sum_: return 0
         target = sum_ - S
         if target % 2: return 0
         target = target // 2
 
         dp = [1] + [0] * target
         for n in nums:
             i = target  
             while(i>=n):  
                 dp[i] += dp[i-n]  
                 i -= 1 
         return dp[target]