-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0416-PartitionEqualSubsetSum.cs
48 lines (40 loc) · 1.46 KB
/
0416-PartitionEqualSubsetSum.cs
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
//-----------------------------------------------------------------------------
// Runtime: 80ms
// Memory Usage: 24.3 MB
// Link: https://leetcode.com/submissions/detail/383853905/
//-----------------------------------------------------------------------------
using System;
namespace LeetCode
{
public class _0416_PartitionEqualSubsetSum
{
public bool CanPartition(int[] nums)
{
int sum = 0, max = int.MinValue;
foreach (var num in nums)
{
sum += num;
max = Math.Max(num, max);
}
if (sum % 2 != 0 || max > sum / 2) return false;
return CanPartition(nums, 2, new bool[nums.Length], sum / 2, 0, 0);
}
private bool CanPartition(int[] nums, int k, bool[] visited, int target, int current, int index)
{
if (k == 1) return true;
if (target == current)
return CanPartition(nums, k - 1, visited, target, 0, 0);
for (int i = index; i < nums.Length; i++)
{
if (visited[i]) continue;
if (current + nums[i] > target) continue;
visited[i] = true;
if (CanPartition(nums, k, visited, target, current + nums[i], i)) return true;
visited[i] = false;
while (i + 1 < nums.Length && nums[i] == nums[i + 1])
i++;
}
return false;
}
}
}