2020-06-14

Author: JiayangWu

1431.拥有最多糖果的孩子/1431-拥有最多糖果的孩子.py

@@ -0,0 +1,9 @@
+class Solution(object):
+    def kidsWithCandies(self, candies, extraCandies):
+        """
+        :type candies: List[int]
+        :type extraCandies: int
+        :rtype: List[bool]
+        """
+        maxCandies = max(candies)            
+        return [curCandies + extraCandies >= maxCandies for curCandies in candies]

1432.改变一个整数能得到的最大差值/1432-改变一个整数能得到的最大差值.py

@@ -0,0 +1,16 @@
+class Solution(object):
+    def maxDiff(self, num):
+        """
+        :type num: int
+        :rtype: int
+        """
+        maxValues, minValues = float("-inf"), float("inf")
+        s = str(num)
+        for x in range(0, 10):
+            for y in range(0, 10):
+                val = s.replace(str(x), str(y))
+                if val[0] != '0' and int(val) != 0:
+                    maxValues = max(maxValues, int(val))
+                    minValues = min(minValues, int(val))
+                    
+        return maxValues - minValues

1433.检查一个字符串是否可以打破另一个字符串/1433-检查一个字符串是否可以打破另一个字符串.py

@@ -0,0 +1,11 @@
+class Solution(object):
+    def checkIfCanBreak(self, s1, s2):
+        """
+        :type s1: str
+        :type s2: str
+        :rtype: bool
+        """
+        s1 = sorted(s1)
+        s2 = sorted(s2)
+        
+        return all(s1[i] >= s2[i] for i in range(len(s1))) or all(s2[i] >= s1[i] for i in range(len(s1)))

1436.旅行终点站/1436-旅行终点站.py

@@ -0,0 +1,7 @@
+class Solution(object):
+    def destCity(self, paths):
+        """
+        :type paths: List[List[str]]
+        :rtype: str
+        """
+        return (set(pair[1] for pair in paths) - set(pair[0] for pair in paths)).pop()

1437.是否所有1都至少相隔k个元素/1437-是否所有1都至少相隔k个元素.py

@@ -0,0 +1,15 @@
+class Solution(object):
+    def kLengthApart(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: bool
+        """
+        pre = None
+        for i, num in enumerate(nums):
+            if num == 1:
+                if pre != None:
+                    if i - pre - 1 < k:
+                        return False
+                pre = i
+        return True