chore: update python solutions

float('inf') -> inf

Author: yanglbme

lcci/03.02.Min Stack/README.md

@@ -27,7 +27,7 @@ class MinStack:
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

lcci/03.02.Min Stack/README_EN.md

@@ -40,7 +40,7 @@ class MinStack:
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

lcci/03.02.Min Stack/Solution.py

@@ -4,7 +4,7 @@ def __init__(self):
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

lcci/16.06.Smallest Difference/README.md

@@ -33,7 +33,7 @@ class Solution:
         a.sort()
         b.sort()
         i = j = 0
-        res = float('inf')
+        res = inf
         while i < len(a) and j < len(b):
             res = min(res, abs(a[i] - b[j]))
             if a[i] > b[j]:

lcci/16.06.Smallest Difference/README_EN.md

@@ -36,7 +36,7 @@ class Solution:
         a.sort()
         b.sort()
         i = j = 0
-        res = float('inf')
+        res = inf
         while i < len(a) and j < len(b):
             res = min(res, abs(a[i] - b[j]))
             if a[i] > b[j]:

lcci/16.06.Smallest Difference/Solution.py

@@ -3,7 +3,7 @@ def smallestDifference(self, a: List[int], b: List[int]) -> int:
         a.sort()
         b.sort()
         i = j = 0
-        res = float('inf')
+        res = inf
         while i < len(a) and j < len(b):
             res = min(res, abs(a[i] - b[j]))
             if a[i] > b[j]:

lcof/面试题30. 包含min函数的栈/README.md

@@ -52,7 +52,7 @@ class MinStack:
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

lcof/面试题30. 包含min函数的栈/Solution.py

@@ -4,7 +4,7 @@ def __init__(self):
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/README.md

@@ -68,7 +68,7 @@
 class Solution:
     def minSubArrayLen(self, target: int, nums: List[int]) -> int:
         n = len(nums)
-        ans = float('inf')
+        ans = inf
         sum = 0
         left, right = 0, 0
         while right < n:
@@ -78,7 +78,7 @@ class Solution:
                 ans = min(ans, right - left)
                 sum -= nums[left]
                 left += 1
-        return 0 if ans == float('inf') else ans
+        return 0 if ans == inf else ans
 ```
 
 ### **Java**

lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/Solution.py

@@ -1,7 +1,7 @@
 class Solution:
     def minSubArrayLen(self, target: int, nums: List[int]) -> int:
         n = len(nums)
-        ans = float('inf')
+        ans = inf
         sum = 0
         left, right = 0, 0
         while right < n:
@@ -11,4 +11,4 @@ def minSubArrayLen(self, target: int, nums: List[int]) -> int:
                 ans = min(ans, right - left)
                 sum -= nums[left]
                 left += 1
-        return 0 if ans == float('inf') else ans
+        return 0 if ans == inf else ans

lcof2/剑指 Offer II 017. 含有所有字符的最短字符串/README.md

@@ -75,7 +75,7 @@ class Solution:
         need, window = defaultdict(int), defaultdict(int)
         for c in t:
             need[c] += 1
-        start, minLen = 0, float('inf')
+        start, minLen = 0, inf
         left, right = 0, 0
         while right < m:
             window[s[right]] += 1
@@ -86,7 +86,7 @@ class Solution:
                     start = left
                 window[s[left]] -= 1
                 left += 1
-        return "" if minLen == float('inf') else s[start:start + minLen]
+        return "" if minLen == inf else s[start:start + minLen]
 
     def check(self, need, window):
         for k, v in need.items():
@@ -109,7 +109,7 @@ class Solution:
             if need[c] == 0:
                 needCount += 1
             need[c] += 1
-        start, minLen = 0, float('inf')
+        start, minLen = 0, inf
         left, right = 0, 0
         while right < m:
             ch = s[right]
@@ -128,7 +128,7 @@ class Solution:
                     if window[ch] == need[ch]:
                         windowCount -= 1
                     window[ch] -= 1
-        return "" if minLen == float('inf') else s[start:start + minLen]
+        return "" if minLen == inf else s[start:start + minLen]
 ```
 
 ### **Java**

lcof2/剑指 Offer II 017. 含有所有字符的最短字符串/Solution.py

@@ -6,7 +6,7 @@
 #         need, window = defaultdict(int), defaultdict(int)
 #         for c in t:
 #             need[c] += 1
-#         start, minLen = 0, float('inf')
+#         start, minLen = 0, inf
 #         left, right = 0, 0
 #         while right < m:
 #             window[s[right]] += 1
@@ -17,7 +17,7 @@
 #                     start = left
 #                 window[s[left]] -= 1
 #                 left += 1
-#         return "" if minLen == float('inf') else s[start:start + minLen]
+#         return "" if minLen == inf else s[start:start + minLen]
 
 #     def check(self, need, window):
 #         for k, v in need.items():
@@ -37,7 +37,7 @@ def minWindow(self, s: str, t: str) -> str:
             if need[c] == 0:
                 needCount += 1
             need[c] += 1
-        start, minLen = 0, float('inf')
+        start, minLen = 0, inf
         left, right = 0, 0
         while right < m:
             ch = s[right]
@@ -56,4 +56,4 @@ def minWindow(self, s: str, t: str) -> str:
                     if window[ch] == need[ch]:
                         windowCount -= 1
                     window[ch] -= 1
-        return "" if minLen == float('inf') else s[start : start + minLen]
+        return "" if minLen == inf else s[start : start + minLen]

lcof2/剑指 Offer II 044. 二叉树每层的最大值/README.md

@@ -96,7 +96,7 @@ class Solution:
         q = deque([root])
         ans = []
         while q:
-            t = float('-inf')
+            t = -inf
             for _ in range(len(q)):
                 node = q.popleft()
                 t = max(t, node.val)

lcof2/剑指 Offer II 044. 二叉树每层的最大值/Solution.py

@@ -11,7 +11,7 @@ def largestValues(self, root: TreeNode) -> List[int]:
         q = deque([root])
         ans = []
         while q:
-            t = float('-inf')
+            t = -inf
             for _ in range(len(q)):
                 node = q.popleft()
                 t = max(t, node.val)

lcof2/剑指 Offer II 051. 节点之和最大的路径/README.md

@@ -71,7 +71,7 @@
 #         self.right = right
 class Solution:
     def maxPathSum(self, root: TreeNode) -> int:
-        ans = float("-inf")
+        ans = -inf
 
         def dfs(node: TreeNode) -> int:
             if not node:

lcof2/剑指 Offer II 051. 节点之和最大的路径/Solution.py

@@ -6,7 +6,7 @@
 #         self.right = right
 class Solution:
     def maxPathSum(self, root: TreeNode) -> int:
-        ans = float("-inf")
+        ans = -inf
 
         def dfs(node: TreeNode) -> int:
             if not node:

solution/0000-0099/0004.Median of Two Sorted Arrays/README.md

@@ -75,8 +75,8 @@ class Solution:
                 return nums1[i + k - 1]
             if k == 1:
                 return min(nums1[i], nums2[j])
-            midVal1 = nums1[i + k // 2 - 1] if i + k // 2 - 1 < m else float('inf')
-            midVal2 = nums2[j + k // 2 - 1] if j + k // 2 - 1 < n else float('inf')
+            midVal1 = nums1[i + k // 2 - 1] if i + k // 2 - 1 < m else inf
+            midVal2 = nums2[j + k // 2 - 1] if j + k // 2 - 1 < n else inf
             if midVal1 < midVal2:
                 return findKth(i + k // 2, j, k - k // 2)
             return findKth(i, j + k // 2, k - k // 2)

solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md

@@ -55,8 +55,8 @@ class Solution:
                 return nums1[i + k - 1]
             if k == 1:
                 return min(nums1[i], nums2[j])
-            midVal1 = nums1[i + k // 2 - 1] if i + k // 2 - 1 < m else float('inf')
-            midVal2 = nums2[j + k // 2 - 1] if j + k // 2 - 1 < n else float('inf')
+            midVal1 = nums1[i + k // 2 - 1] if i + k // 2 - 1 < m else inf
+            midVal2 = nums2[j + k // 2 - 1] if j + k // 2 - 1 < n else inf
             if midVal1 < midVal2:
                 return findKth(i + k // 2, j, k - k // 2)
             return findKth(i, j + k // 2, k - k // 2)

solution/0000-0099/0004.Median of Two Sorted Arrays/Solution.py

@@ -7,8 +7,8 @@ def findKth(i, j, k):
                 return nums1[i + k - 1]
             if k == 1:
                 return min(nums1[i], nums2[j])
-            midVal1 = nums1[i + k // 2 - 1] if i + k // 2 - 1 < m else float('inf')
-            midVal2 = nums2[j + k // 2 - 1] if j + k // 2 - 1 < n else float('inf')
+            midVal1 = nums1[i + k // 2 - 1] if i + k // 2 - 1 < m else inf
+            midVal2 = nums2[j + k // 2 - 1] if j + k // 2 - 1 < n else inf
             if midVal1 < midVal2:
                 return findKth(i + k // 2, j, k - k // 2)
             return findKth(i, j + k // 2, k - k // 2)

solution/0000-0099/0053.Maximum Subarray/README.md

@@ -92,7 +92,7 @@ class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
         def crossMaxSub(nums, left, mid, right):
             lsum = rsum = 0
-            lmx = rmx = float('-inf')
+            lmx = rmx = -inf
             for i in range(mid, left - 1, -1):
                 lsum += nums[i]
                 lmx = max(lmx, lsum)

solution/0000-0099/0053.Maximum Subarray/README_EN.md

@@ -71,7 +71,7 @@ class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
         def crossMaxSub(nums, left, mid, right):
             lsum = rsum = 0
-            lmx = rmx = float('-inf')
+            lmx = rmx = -inf
             for i in range(mid, left - 1, -1):
                 lsum += nums[i]
                 lmx = max(lmx, lsum)

solution/0000-0099/0076.Minimum Window Substring/README.md

@@ -74,7 +74,7 @@ class Solution:
             return ans
         need = Counter(t)
         window = Counter()
-        i, cnt, mi = 0, 0, float('inf')
+        i, cnt, mi = 0, 0, inf
         for j, c in enumerate(s):
             window[c] += 1
             if need[c] >= window[c]:

solution/0000-0099/0076.Minimum Window Substring/README_EN.md

@@ -64,7 +64,7 @@ class Solution:
             return ans
         need = Counter(t)
         window = Counter()
-        i, cnt, mi = 0, 0, float('inf')
+        i, cnt, mi = 0, 0, inf
         for j, c in enumerate(s):
             window[c] += 1
             if need[c] >= window[c]:

solution/0000-0099/0076.Minimum Window Substring/Solution.py

@@ -6,7 +6,7 @@ def minWindow(self, s: str, t: str) -> str:
             return ans
         need = Counter(t)
         window = Counter()
-        i, cnt, mi = 0, 0, float('inf')
+        i, cnt, mi = 0, 0, inf
         for j, c in enumerate(s):
             window[c] += 1
             if need[c] >= window[c]:

solution/0000-0099/0098.Validate Binary Search Tree/README.md

@@ -76,7 +76,7 @@ class Solution:
                 return False
             return True
 
-        prev = float('-inf')
+        prev = -inf
         return dfs(root)
 ```
 

solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md

@@ -66,7 +66,7 @@ class Solution:
                 return False
             return True
 
-        prev = float('-inf')
+        prev = -inf
         return dfs(root)
 ```
 

solution/0000-0099/0098.Validate Binary Search Tree/Solution.py

@@ -19,5 +19,5 @@ def dfs(root):
                 return False
             return True
 
-        prev = float('-inf')
+        prev = -inf
         return dfs(root)

solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md

@@ -65,7 +65,7 @@
 #         self.right = right
 class Solution:
     def maxPathSum(self, root: TreeNode) -> int:
-        ans = float("-inf")
+        ans = -inf
 
         def dfs(node: TreeNode) -> int:
             if not node:

solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md

@@ -50,7 +50,7 @@
 #         self.right = right
 class Solution:
     def maxPathSum(self, root: TreeNode) -> int:
-        ans = float("-inf")
+        ans = -inf
 
         def dfs(node: TreeNode) -> int:
             if not node:

solution/0100-0199/0124.Binary Tree Maximum Path Sum/Solution.py

@@ -6,7 +6,7 @@
 #         self.right = right
 class Solution:
     def maxPathSum(self, root: TreeNode) -> int:
-        ans = float("-inf")
+        ans = -inf
 
         def dfs(node: TreeNode) -> int:
             if not node:

solution/0100-0199/0155.Min Stack/README.md

@@ -71,7 +71,7 @@ class MinStack:
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

solution/0100-0199/0155.Min Stack/README_EN.md

@@ -63,7 +63,7 @@ class MinStack:
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

solution/0100-0199/0155.Min Stack/Solution.py

@@ -4,7 +4,7 @@ def __init__(self):
         initialize your data structure here.
         """
         self.s = []
-        self.mins = [float('inf')]
+        self.mins = [inf]
 
     def push(self, val: int) -> None:
         self.s.append(val)

solution/0200-0299/0244.Shortest Word Distance II/README.md

@@ -67,7 +67,7 @@ class WordDistance:
     def shortest(self, word1: str, word2: str) -> int:
         idx1, idx2 = self.words[word1], self.words[word2]
         i1 = i2 = 0
-        shortest = float('inf')
+        shortest = inf
         while i1 < len(idx1) and i2 < len(idx2):
             shortest = min(shortest, abs(idx1[i1] - idx2[i2]))
             smaller = idx1[i1] < idx2[i2]

solution/0200-0299/0244.Shortest Word Distance II/README_EN.md

@@ -60,7 +60,7 @@ class WordDistance:
     def shortest(self, word1: str, word2: str) -> int:
         idx1, idx2 = self.words[word1], self.words[word2]
         i1 = i2 = 0
-        shortest = float('inf')
+        shortest = inf
         while i1 < len(idx1) and i2 < len(idx2):
             shortest = min(shortest, abs(idx1[i1] - idx2[i2]))
             smaller = idx1[i1] < idx2[i2]

solution/0200-0299/0244.Shortest Word Distance II/Solution.py

@@ -9,7 +9,7 @@ def __init__(self, wordsDict: List[str]):
     def shortest(self, word1: str, word2: str) -> int:
         idx1, idx2 = self.words[word1], self.words[word2]
         i1 = i2 = 0
-        shortest = float('inf')
+        shortest = inf
         while i1 < len(idx1) and i2 < len(idx2):
             shortest = min(shortest, abs(idx1[i1] - idx2[i2]))
             smaller = idx1[i1] < idx2[i2]