128-weekly-contenst-python

Author: BradyHu

solution/1012.Complement of Base 10 Integer/Solution.py

@@ -0,0 +1,13 @@
+class Solution:
+
+    def bitwiseComplement(self, N: int) -> int:
+        if N == 0:
+            return 1
+        ans = 0
+        index = 0
+        while N > 1:
+            if N % 2 == 0:
+                ans += 2**index
+            index += 1
+            N = N // 2
+        return ans

solution/1013.Pairs of Songs With Total Durations Divisible by 60/Solution.py

@@ -0,0 +1,23 @@
+class Solution:
+
+    def numPairsDivisibleBy60(self, time: List[int]) -> int:
+        ans = 0
+        time = [i % 60 for i in time]
+        # 整60s的歌曲，任取两个都满足
+        count = 0
+        while 0 in time:
+            count += 1
+            time.remove(0)
+        ans += count * (count - 1) // 2
+
+        d = {}
+        for item in time:
+            d[item] = d.get(item, 0) + 1
+        # 整30s的歌曲，任取两个也是满足的
+        ans += d.get(30, 0) * (d.get(30, 0) - 1) // 2
+
+        # 既不是60s也不是30s的歌曲，只能找时间上互补的歌曲
+        for i in range(1, 30):
+            ans += d.get(i, 0) * d.get(60 - i, 0)
+
+        return ans

solution/1014.Capacity To Ship Packages Within D Days/Solution.py

@@ -0,0 +1,26 @@
+class Solution:
+
+    def shipWithinDays(self, weights: List[int], D: int) -> int:
+        ans = max(max(weights), sum(weights) // D)
+
+        # 判断某一个运载量能否支撑运载
+        def can_trans(ans, weights, D):
+            # print('input : ',ans)
+            tmp = 0
+            while D >= 0 and weights:
+                w = weights.pop()
+                if tmp + w <= ans:
+                    tmp += w
+                else:
+                    # print(D,tmp,weights+[w])
+                    D -= 1
+                    tmp = w
+            if D > 1:
+                return True
+            elif D > 0 and tmp <= ans:
+                return True
+            return False
+
+        while not can_trans(ans, weights[:], D):
+            ans += 1
+        return ans