partially completed weekly contest 426

Author: MrHuxu

identify-the-largest-outlier-in-an-array.py

@@ -0,0 +1,25 @@
+from typing import List
+
+
+class Solution:
+    def getLargestOutlier(self, nums: List[int]) -> int:
+        sum, cnt = 0, {}
+        for num in nums:
+            sum += num
+            cnt[num] = cnt.get(num, 0) + 1
+
+        for num in sorted(set(nums), reverse=True):
+            tmp = sum - num
+            if tmp % 2:
+                continue
+
+            cnt[num] -= 1
+            if cnt.get(tmp // 2, 0):
+                return num
+            cnt[num] += 1
+        return -1
+
+
+print(Solution().getLargestOutlier(nums=[2, 3, 5, 10]))
+print(Solution().getLargestOutlier(nums=[1, 1, 1, 1, 1, 5, 5]))
+print(Solution().getLargestOutlier(nums=[-2, -1, -3, -6, 4]))

maximize-the-number-of-target-nodes-after-connecting-trees-i.py

@@ -0,0 +1,70 @@
+from typing import List
+
+
+class Solution:
+    def maxTargetNodes(
+        self, edges1: List[List[int]], edges2: List[List[int]], k: int
+    ) -> List[int]:
+        n, m = 0, 0
+        adj1, adj2 = {}, {}
+        for u, v in edges1:
+            n = max(n, u + 1, v + 1)
+            adj1.setdefault(u, []).append(v)
+            adj1.setdefault(v, []).append(u)
+        for u, v in edges2:
+            m = max(m, u + 1, v + 1)
+            adj2.setdefault(u, []).append(v)
+            adj2.setdefault(v, []).append(u)
+
+        cnt1, cnt2 = [0] * n, [0] * m
+        for i in range(n):
+            queue = [(i, 0)]
+            visited = {i}
+            while queue:
+                u, d = queue.pop(0)
+                if d > k:
+                    break
+                cnt1[i] += 1
+
+                for v in adj1.get(u, []):
+                    if v not in visited:
+                        visited.add(v)
+                        queue.append((v, d + 1))
+        for i in range(m):
+            queue = [(i, 0)]
+            visited = {i}
+            while queue:
+                u, d = queue.pop(0)
+                if d >= k:
+                    break
+                cnt2[i] += 1
+
+                for v in adj2.get(u, []):
+                    if v not in visited:
+                        visited.add(v)
+                        queue.append((v, d + 1))
+        max2 = max(cnt2)
+        return [c + max2 for c in cnt1]
+
+
+print(
+    Solution().maxTargetNodes(
+        edges1=[[0, 1], [0, 2], [2, 3], [2, 4]],
+        edges2=[[0, 1], [0, 2], [0, 3], [2, 7], [1, 4], [4, 5], [4, 6]],
+        k=2,
+    )
+)
+
+print(
+    Solution().maxTargetNodes(
+        edges1=[[0, 1], [0, 2], [0, 3], [0, 4]], edges2=[[0, 1], [1, 2], [2, 3]], k=1
+    )
+)
+
+print(
+    Solution().maxTargetNodes(
+        [[2, 1], [7, 3], [0, 4], [7, 5], [2, 6], [0, 2], [0, 7]],
+        [[3, 0], [1, 2], [5, 1], [6, 3], [9, 4], [5, 6], [7, 5], [9, 7], [8, 9]],
+        7,
+    )
+)

smallest-number-with-all-set-bits.py

@@ -0,0 +1,12 @@
+class Solution:
+    def smallestNumber(self, n: int) -> int:
+        ret = 0
+        while n:
+            ret = (ret << 1) + 1
+            n >>= 1
+        return ret
+
+
+print(Solution().smallestNumber(5))
+print(Solution().smallestNumber(10))
+print(Solution().smallestNumber(3))