080425

Author: aluferraz

leetcode/editor/en/Q416/PartitionEqualSubsetSum.py

@@ -0,0 +1,34 @@
+import collections
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def canPartition(self, nums: List[int]) -> bool:
+        N = len(nums)
+        q = collections.deque([(0, 0, 0)])
+        seen = {(0, 0, 0)}
+        while q:
+            size = len(q)
+            for i in range(size):
+                idx, l, r = q.pop()
+                if idx == N:
+                    if l == r:
+                        return True
+                    continue
+                use = (idx + 1, l + nums[idx], r)
+                if use not in seen:
+                    seen.add(use)
+                    q.append(use)
+                skip = (idx + 1, l, r + nums[idx])
+                if skip not in seen:
+                    seen.add(skip)
+                    q.append(skip)
+        return False
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class PartitionEqualSubsetSum(Solution):
+    pass

main.py

@@ -1,4 +1,4 @@
-from leetcode.editor.en.Q2873.MaximumValueOfAnOrderedTripletI import MaximumValueOfAnOrderedTripletI
+from leetcode.editor.en.Q416.PartitionEqualSubsetSum import PartitionEqualSubsetSum
 
 if __name__ == '__main__':
-    print(MaximumValueOfAnOrderedTripletI().maximumTripletValue([5, 7, 8, 4]))
+    print(PartitionEqualSubsetSum().canPartition([1, 5, 11, 5]))