feat: update python solutions to lc problems

Author: yanglbme

solution/0800-0899/0852.Peak Index in a Mountain Array/README.md

@@ -174,6 +174,24 @@ var peakIndexInMountainArray = function (arr) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function peakIndexInMountainArray(arr: number[]): number {
+    let left = 1,
+        right = arr.length - 2;
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (arr[mid] > arr[mid + 1]) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return left;
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0852.Peak Index in a Mountain Array/README_EN.md

@@ -149,6 +149,24 @@ var peakIndexInMountainArray = function (arr) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function peakIndexInMountainArray(arr: number[]): number {
+    let left = 1,
+        right = arr.length - 2;
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (arr[mid] > arr[mid + 1]) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return left;
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0852.Peak Index in a Mountain Array/Solution.ts

@@ -0,0 +1,13 @@
+function peakIndexInMountainArray(arr: number[]): number {
+    let left = 1,
+        right = arr.length - 2;
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (arr[mid] > arr[mid + 1]) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return left;
+}

solution/0900-0999/0981.Time Based Key-Value Store/README.md

@@ -83,7 +83,7 @@ class TimeMap:
             return ''
         tv = self.ktv[key]
         # #查找第一个大于timestamp的
-        i = bisect.bisect_right(tv, (timestamp, chr(127)))
+        i = bisect_right(tv, (timestamp, chr(127)))
         return tv[i - 1][1] if i else ''
 
 

solution/0900-0999/0981.Time Based Key-Value Store/README_EN.md

@@ -67,7 +67,7 @@ class TimeMap:
         if key not in self.ktv:
             return ''
         tv = self.ktv[key]
-        i = bisect.bisect_right(tv, (timestamp, chr(127)))
+        i = bisect_right(tv, (timestamp, chr(127)))
         return tv[i - 1][1] if i else ''
 
 

solution/0900-0999/0981.Time Based Key-Value Store/Solution.py

@@ -1,22 +1,22 @@
-class TimeMap:
-    def __init__(self):
-        """
-        Initialize your data structure here.
-        """
-        self.ktv = defaultdict(list)
-
-    def set(self, key: str, value: str, timestamp: int) -> None:
-        self.ktv[key].append((timestamp, value))
-
-    def get(self, key: str, timestamp: int) -> str:
-        if key not in self.ktv:
-            return ''
-        tv = self.ktv[key]
-        i = bisect.bisect_right(tv, (timestamp, chr(127)))
-        return tv[i - 1][1] if i else ''
-
-
-# Your TimeMap object will be instantiated and called as such:
-# obj = TimeMap()
-# obj.set(key,value,timestamp)
-# param_2 = obj.get(key,timestamp)
+class TimeMap:
+    def __init__(self):
+        """
+        Initialize your data structure here.
+        """
+        self.ktv = defaultdict(list)
+
+    def set(self, key: str, value: str, timestamp: int) -> None:
+        self.ktv[key].append((timestamp, value))
+
+    def get(self, key: str, timestamp: int) -> str:
+        if key not in self.ktv:
+            return ''
+        tv = self.ktv[key]
+        i = bisect_right(tv, (timestamp, chr(127)))
+        return tv[i - 1][1] if i else ''
+
+
+# Your TimeMap object will be instantiated and called as such:
+# obj = TimeMap()
+# obj.set(key,value,timestamp)
+# param_2 = obj.get(key,timestamp)

solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README.md

@@ -92,7 +92,7 @@ class Solution:
 ```python
 class Solution:
     def isMajorityElement(self, nums: List[int], target: int) -> bool:
-        left, right = bisect.bisect_left(nums, target), bisect.bisect_right(nums, target)
+        left, right = bisect_left(nums, target), bisect_right(nums, target)
         return right - left > (len(nums) >> 1)
 ```
 

solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README_EN.md

@@ -76,7 +76,7 @@ class Solution:
 ```python
 class Solution:
     def isMajorityElement(self, nums: List[int], target: int) -> bool:
-        left, right = bisect.bisect_left(nums, target), bisect.bisect_right(nums, target)
+        left, right = bisect_left(nums, target), bisect_right(nums, target)
         return right - left > (len(nums) >> 1)
 ```
 

solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/Solution.py

@@ -1,6 +1,6 @@
-class Solution:
-    def isMajorityElement(self, nums: List[int], target: int) -> bool:
-        left, right = bisect.bisect_left(nums, target), bisect.bisect_right(
-            nums, target
-        )
-        return right - left > (len(nums) >> 1)
+class Solution:
+    def isMajorityElement(self, nums: List[int], target: int) -> bool:
+        left, right = bisect_left(nums, target), bisect_right(
+            nums, target
+        )
+        return right - left > (len(nums) >> 1)

solution/1800-1899/1889.Minimum Space Wasted From Packaging/README.md

@@ -85,7 +85,7 @@ class Solution:
                 continue
             t = last = 0
             for b in box:
-                idx = bisect.bisect_right(packages, b, lo=last)
+                idx = bisect_right(packages, b, lo=last)
                 t += (idx - last) * b
                 last = idx
             res = min(res, t)