-
Notifications
You must be signed in to change notification settings - Fork 7
/
leetcode416.cpp
61 lines (51 loc) · 1.12 KB
/
leetcode416.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
bool canPartition(vector<int>& nums) {
int s = sum(nums);
if (s & 1)
return false;
s = s / 2; // 背包容量
vector<int> dp(s + 1, 0);
dp[0] = 1;
for (int i = 0; i < nums.size(); ++i)
for (int j = s; j >= nums[i]; --j) // 01背包
{
dp[j] = dp[j - nums[i]] + dp[j];
// leetcode 测试不通过,因为有大数相加 int 溢出,使用 canPartition2 稍微改一下就好了
}
return bool(dp[s]);
}
bool canPartition2(vector<int>& nums) {
int s = sum(nums);
if (s & 1)
return false;
s = s / 2; // 背包容量
vector<int> dp(s + 1, false);
dp[0] = true;
for (int i = 0; i < nums.size(); ++i)
for (int j = s; j >= nums[i]; --j) // 01背包
{
dp[j] = dp[j - nums[i]] || dp[j];
}
return dp[s];
}
int sum(vector<int> nums)
{
int s = 0;
for (int i = 0; i < nums.size(); ++i)
s += nums[i];
return s;
}
};
int main()
{
vector<int> nums{1, 5, 11, 5};
Solution f;
cout << f.canPartition(nums) << endl;
cout << f.canPartition2(nums) << endl;
getchar();
}