698

Author: ProHiryu

DFS/traditionalDFS/698.md

@@ -1 +1,54 @@
+## Partition to K Equal Sum Subsets
 
+#### Description
+
+[link](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/description/)
+
+---
+
+#### Solution
+
+- See Code
+
+---
+
+#### Code
+
+> 最坏情况：O(n^2)
+
+```python
+class Solution:
+    def canPartitionKSubsets(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: bool
+        """
+        l, s = len(nums), sum(nums)
+        
+        if s % k:
+            return False
+         
+        self.tar = int(s / k)
+        self.l = l
+        
+        visit = [0 for _ in range(l)]
+                 
+        nums.sort(reverse = True)
+        def dfs(k, index, s, cnt):
+            if k == 1:
+                return True
+            
+            if s == self.tar and cnt > 0:
+                return dfs(k - 1, 0, 0, 0)
+            
+            for i in range(index, self.l):
+                if not visit[i] and nums[i] + s <= self.tar:
+                    visit[i] = 1
+                    if dfs(k, i + 1, s + nums[i], cnt + 1):
+                        return True
+                    visit[i] = 0
+            return False
+        
+        return dfs(k, 0, 0, 0)
+```