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