feat: update solutions to lc problem: No.0167

No.0167.Two Sum II - Input array is sorted

Author: yanglbme

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md

@@ -106,30 +106,6 @@ int search(int left, int right) {
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
-```python
-class Solution:
-    def searchRange(self, nums: List[int], target: int) -> List[int]:
-        if len(nums) == 0:
-            return [-1, -1]
-        left, right = 0, len(nums) - 1
-        while left < right:
-            mid = (left + right) >> 1
-            if nums[mid] >= target:
-                right = mid
-            else:
-                left = mid + 1
-        if nums[left] != target:
-            return [-1, -1]
-        l, right = left, len(nums) - 1
-        while left < right:
-            mid = (left + right + 1) >> 1
-            if nums[mid] <= target:
-                left = mid
-            else:
-                right = mid - 1
-        return [l, left]
-```
-
 ```python
 class Solution:
     def searchRange(self, nums: List[int], target: int) -> List[int]:
@@ -203,40 +179,6 @@ class Solution {
 
 ### **C++**
 
-```cpp
-class Solution {
-public:
-    vector<int> searchRange(vector<int>& nums, int target) {
-        if (nums.size() == 0) {
-            return vector<int>{-1, -1};
-        }
-        int left = 0, right = nums.size() - 1;
-        while (left < right) {
-            int mid = left + right >> 1;
-            if (nums[mid] >= target) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
-        }
-        if (nums[left] != target) {
-            return vector<int>{-1, -1};
-        }
-        int l = left;
-        right = nums.size() - 1;
-        while (left < right) {
-            int mid = left + right + 1 >> 1;
-            if (nums[mid] <= target) {
-                left = mid;
-            } else {
-                right = mid - 1;
-            }
-        }
-        return vector<int>{l, left};
-    }
-};
-```
-
 ```cpp
 class Solution {
 public:

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md

@@ -75,30 +75,6 @@ int search(int left, int right) {
 
 ### **Python3**
 
-```python
-class Solution:
-    def searchRange(self, nums: List[int], target: int) -> List[int]:
-        if len(nums) == 0:
-            return [-1, -1]
-        left, right = 0, len(nums) - 1
-        while left < right:
-            mid = (left + right) >> 1
-            if nums[mid] >= target:
-                right = mid
-            else:
-                left = mid + 1
-        if nums[left] != target:
-            return [-1, -1]
-        l, right = left, len(nums) - 1
-        while left < right:
-            mid = (left + right + 1) >> 1
-            if nums[mid] <= target:
-                left = mid
-            else:
-                right = mid - 1
-        return [l, left]
-```
-
 ```python
 class Solution:
     def searchRange(self, nums: List[int], target: int) -> List[int]:
@@ -170,40 +146,6 @@ class Solution {
 
 ### **C++**
 
-```cpp
-class Solution {
-public:
-    vector<int> searchRange(vector<int>& nums, int target) {
-        if (nums.size() == 0) {
-            return vector<int>{-1, -1};
-        }
-        int left = 0, right = nums.size() - 1;
-        while (left < right) {
-            int mid = left + right >> 1;
-            if (nums[mid] >= target) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
-        }
-        if (nums[left] != target) {
-            return vector<int>{-1, -1};
-        }
-        int l = left;
-        right = nums.size() - 1;
-        while (left < right) {
-            int mid = left + right + 1 >> 1;
-            if (nums[mid] <= target) {
-                left = mid;
-            } else {
-                right = mid - 1;
-            }
-        }
-        return vector<int>{l, left};
-    }
-};
-```
-
 ```cpp
 class Solution {
 public: