2020-08-22

Author: JiayangWu

1534.统计好三元组/1534-统计好三元组.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def countGoodTriplets(self, arr, a, b, c):
+        """
+        :type arr: List[int]
+        :type a: int
+        :type b: int
+        :type c: int
+        :rtype: int
+        """
+        res = 0
+        for i in range(len(arr)):
+            for j in range(i + 1, len(arr)):
+                for k in range(j + 1, len(arr)):
+                    if abs(arr[i] - arr[j]) <= a and \
+                       abs(arr[j] - arr[k]) <= b and \
+                       abs(arr[i] - arr[k]) <= c:
+                       res += 1
+        return res

1535.找出数组游戏的赢家/1535-找出数组游戏的赢家.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def getWinner(self, arr, k):
+        """
+        :type arr: List[int]
+        :type k: int
+        :rtype: int
+        """
+        pre = max(arr[0], arr[1])
+        cnt = 1
+        for num in arr[2:]:
+            if cnt == k:
+                return pre
+            if pre > num:
+                cnt += 1
+            else:
+                pre = num 
+                cnt = 1
+        return pre
+            

1536.排布二进制网格的最少交换次数/1536-排布二进制网格的最少交换次数.py

@@ -0,0 +1,34 @@
+class Solution(object):
+    def minSwaps(self, grid):
+        """
+        :type grid: List[List[int]]
+        :rtype: int
+        """
+        from collections import defaultdict, deque
+        dic = dict()
+        n = len(grid)
+        for i, row in enumerate(grid):
+            cnt = 0
+            for j in range(n - 1, -1, -1):
+                if not row[j]:
+                    cnt += 1
+                else:
+                    break
+            dic[i] = cnt
+
+        res = 0
+        for i in range(n):
+            zero_cnt = dic[i]
+
+            if zero_cnt < n - i - 1:
+                for j in range(i + 1, n):
+                    if dic[j] >= n - i - 1:
+                        break 
+                if dic[j] < n - i - 1:
+                    return -1
+                tmp = dic[j]
+                res += j - i
+                for k in range(j, i, -1):
+                    dic[k] = dic[k - 1]
+            
+        return res