add weekly-contest 382

Author: Navy.Tian

weekly-contest/122d/p4_3012.py

@@ -6,7 +6,7 @@
 
 class Solution:
  def minimumCost(self, nums: List[int], k: int, dist: int) -> int:
- # TODO
+ # TODO:
  ...
 
 

weekly-contest/379/p4_3003.py

@@ -3,7 +3,7 @@
 
 class Solution:
  def maxPartitionsAfterOperations(self, s: str, k: int) -> int:
- # TODO
+ # TODO:
  ...
 
 

weekly-contest/380/p3_3007.py

@@ -1,6 +1,6 @@
 class Solution:
  def findMaximumNumber(self, k: int, x: int) -> int:
- # TODO
+ # TODO:
  ...
 
 

weekly-contest/380/p4_3008.py

@@ -3,7 +3,7 @@
 
 class Solution:
  def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:
- # TODO
+ # TODO:
  ...
 
 

weekly-contest/381/p4_100213.py

@@ -3,7 +3,7 @@
 
 class Solution:
  def countOfPairs(self, n: int, x: int, y: int) -> List[int]:
- # TODO
+ # TODO:
  # distances = {}
  # for i in range(1, n + 1):
  # for j in range(i + 1, n + 1):

weekly-contest/382/p1_100215.py

@@ -0,0 +1,18 @@
+class Solution:
+ def countKeyChanges(self, s: str) -> int:
+ ans = 0
+ index = 0
+ s = s.lower()
+ pre_char = s[0]
+ while index < len(s):
+ if s[index] != pre_char:
+ ans += 1
+ pre_char = s[index]
+ index += 1
+ return ans
+
+
+if __name__ == "__main__":
+ assert Solution().countKeyChanges("abc") == 2
+ assert Solution().countKeyChanges("aAbBcC") == 2
+ assert Solution().countKeyChanges("AaAaAaaA") == 0

weekly-contest/382/p2_100206.py

@@ -0,0 +1,12 @@
+from typing import List
+
+
+class Solution:
+ def maximumLength(self, nums: List[int]) -> int:
+ # TODO:
+ ...
+
+
+if __name__ == "__main__":
+ assert Solution().maximumLength(nums=[5, 4, 1, 2, 2]) == 3
+ assert Solution().maximumLength(nums=[1, 3, 2, 4]) == 1

weekly-contest/382/p3_100195.py

@@ -0,0 +1,8 @@
+class Solution:
+ def flowerGame(self, n: int, m: int) -> int:
+ return n * m // 2
+
+
+if __name__ == "__main__":
+ assert Solution().flowerGame(3, 2) == 3
+ assert Solution().flowerGame(1, 1) == 0

weekly-contest/382/p4_100179.py

@@ -0,0 +1,13 @@
+from typing import List
+
+
+class Solution:
+ def minOrAfterOperations(self, nums: List[int], k: int) -> int:
+ # TODO:
+ ...
+
+
+if __name__ == "__main__":
+ assert Solution().minOrAfterOperations(nums=[3, 5, 3, 2, 7], k=2) == 3
+ assert Solution().minOrAfterOperations(nums=[7, 3, 15, 14, 2, 8], k=4) == 2
+ assert Solution().minOrAfterOperations(nums=[10, 7, 10, 3, 9, 14, 9, 4], k=1) == 15