leetcode

0 class Solution {

1 public:

2 bool canPartition(vector<int> &nums) {

3 int sum = accumulate(nums.begin(), nums.end(), 0), hsum = sum / 2;

4 if (sum % 2) return false;

5 vector<bool> dp(hsum + 1, false);

6

7 dp[0] = true;

8 for (int num : nums)

9 for (int j = hsum; j >= num; j--)

10 if (dp[j - num]) dp[j] = true;

11

12 return dp.back();

13 }

14 };