Leetcode 416 Partition Equal Subset Sum (算法分析week14)

Partition Equal Subset Sum

题目来源：https://leetcode.com/problemset/algorithms/

-题目描述-
-算法分析-
-代码实现-

题目描述

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.

代码实现

题目目的是给定数组nums，判断nums是否能分为两个元素和相等的子数组。
定义sum为nums中所有元素的和。如果sum%2==1，那么nums一定不能分为两个元素和相等的子数组。
定义布尔型数组dp，dp[i]表示能否选取若干个nums中的元素使其和等于i。如果dp[i]==true，那么dp[i+nums[j]] = true。(dp[0]=true)
那么nums能否分为两个元素和相等的子数组等价于dp[sum/2]是否为true。

代码实现

@requires_authorization
class Solution {
public:
    bool canPartition(vector<int>& nums) {
    int n = nums.size();
    int sum = 0;
    for (int i = 0; i < n; i++) {
        sum += nums[i];
    }
    bool dp[30000];
    dp[0] = true;
    for (int i = 1; i < sum + 1; i++) {
        dp[i] = false;
    }
    if (sum % 2 != 0) return false;
    int k = sum / 2;
    // nums每个元素最多使用一次
    for (int i = 0; i < n; i++) {
        for (int j = k; j >= 0; j--) {
            if (dp[j] == true) 
                dp[j+nums[i]] = true;
        }
    }
    return dp[k];
}
};