add double 121 weekly-contest

Author: Navy.Tian

weekly-contest/121d/p1_2996.py

@@ -0,0 +1,22 @@
+from typing import List
+
+
+class Solution:
+    """https://leetcode.cn/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/"""
+
+    def missingInteger(self, nums: List[int]) -> int:
+        prefix_sum = nums[0]
+        for i in range(1, len(nums)):
+            if nums[i] == nums[i - 1] + 1:
+                prefix_sum += nums[i]
+            else:
+                break
+        temp = set(nums)
+        while prefix_sum in temp:
+            prefix_sum += 1
+        return prefix_sum
+
+
+if __name__ == "__main__":
+    assert Solution().missingInteger([1, 2, 3, 2, 5]) == 6
+    assert Solution().missingInteger([3, 4, 5, 1, 12, 14, 13]) == 15

weekly-contest/121d/p2_2997.py

@@ -0,0 +1,19 @@
+from functools import reduce
+from typing import List
+
+
+class Solution:
+    def minOperations(self, nums: List[int], k: int) -> int:
+        value = reduce(lambda x, y: x ^ y, nums) ^ k
+        count = 0
+        while value:
+            if value & 1:
+                count += 1
+            value >>= 1
+        return count
+
+
+if __name__ == "__main__":
+    assert Solution().minOperations([2, 1, 3, 4], 1) == 2
+    assert Solution().minOperations([2, 0, 2, 0], 0) == 0
+    assert Solution().minOperations([4], 7) == 2

weekly-contest/121d/p3_2998.py

@@ -0,0 +1,43 @@
+from typing import List, Tuple
+
+
+class Solution:
+    def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:
+        queue: List[Tuple[int, int]] = [(x, 0)]
+        uniques = set()
+        while queue:
+            cur_value, cur_cnt = queue[0]
+            values: List[int] = [cur_value]
+            for i in range(1, len(queue)):
+                value, cnt = queue[i]
+                if cnt == cur_cnt:
+                    values.append(value)
+                else:
+                    break
+            for value in values:
+                if value == y:
+                    return cur_cnt
+                else:
+                    if value > y:
+                        if value - 1 not in uniques:
+                            queue.append((value - 1, cur_cnt + 1))
+                            uniques.add(value - 1)
+                        if value % 11 == 0 and value // 11 not in uniques:
+                            queue.append((value // 11, cur_cnt + 1))
+                            uniques.add(value // 11)
+                        if value % 5 == 0 and value // 5 not in uniques:
+                            queue.append((value // 5, cur_cnt + 1))
+                            uniques.add(value // 5)
+                    if value + 1 not in uniques:
+                        queue.append((value + 1, cur_cnt + 1))
+                        uniques.add(value + 1)
+            queue = queue[len(values) :]
+        return -1
+
+
+if __name__ == "__main__":
+    assert Solution().minimumOperationsToMakeEqual(26, 1) == 3
+    assert Solution().minimumOperationsToMakeEqual(54, 2) == 4
+    assert Solution().minimumOperationsToMakeEqual(25, 30) == 5
+    assert Solution().minimumOperationsToMakeEqual(1, 16) == 15
+    assert Solution().minimumOperationsToMakeEqual(89, 57) == 32

weekly-contest/121d/p4_2999.py

@@ -0,0 +1,12 @@
+class Solution:
+    def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:
+        # TODO: 未完成
+        # 枚举会超时
+        # 组合与排列，但如何排队最高位与 limit 相同但又不在 finish 之内的数呢？似乎数量级也在 10**14 会超时
+        ...
+
+
+if __name__ == "__main__":
+    assert Solution().numberOfPowerfulInt(start=1, finish=6000, limit=4, s="124") == 5
+    assert Solution().numberOfPowerfulInt(start=15, finish=215, limit=6, s="10") == 2
+    assert Solution().numberOfPowerfulInt(start=1000, finish=2000, limit=4, s="3000") == 0