Leetcode416

Partition Equal Subset Sum:
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
Note:
Each of the array element will not exceed 100.
The array size will not exceed 200.
Example 1:
Input: [1, 5, 11, 5]
Output: true
Explanation: The array can be partitioned as [1, 5, 5] and [11].
Example 2:
Input: [1, 2, 3, 5]
Output: false
Explanation: The array cannot be partitioned into equal sum subsets.

Solution: 动态规划，01背包问题

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    bool canPartition(vector<int>& nums) {

        int sum = 0;
        for (int i = 0; i < nums.size(); i++){
            sum = sum + nums[i];
        }

        if ( sum%2 != 0 )
            return false;

        int n = nums.size();
        int C = sum / 2;
        vector<bool> memo(C+1, false);

        for( int i = 0; i <= C; i++){
            memo[i] = ( nums[0] == i );
        }

        for ( int i = 1; i < n; i++){
            for (int j = C; j > nums[i] ; j--) {
                memo[j] = memo[j] || memo[j-nums[i]];
            }
        }

        return memo[C];
    }
};

总结：可以将问题转化成背包问题：