-
Notifications
You must be signed in to change notification settings - Fork 1
/
416+Output.cpp
50 lines (40 loc) · 1.24 KB
/
416+Output.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
class Solution {
public:
bool canPartition(vector<int>& nums) {
int n = nums.size();
int sumn = accumulate(nums.begin(), nums.end(), 0);
if (sumn & 1) return false;
int target = sumn / 2;
vector<bool> dp(target + 1, false);
vector<vector<bool>> path(n, vector<bool>(target + 1, false)); // path
dp[0] = true;
for (int i = 0; i < n; ++i) {
int num = nums[i];
for (int j = target; j >= 0; --j) {
if (j - num < 0) {
dp[j] = dp[j];
} else {
dp[j] = dp[j] | dp[j-num];
path[i][j] = dp[j];
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= target; ++j) {
cout << path[i][j] << " ";
}
cout << endl;
}
int ans[n];
int k = 0;
for (int i = n-1; i >= 0; --i) {
if (path[i][target]) {
ans[++k] = i;
target -= nums[i];
}
}
for (int i = k; i > 0; --i)
cout << ans[i] << " ";
return dp[sumn / 2];
}
};