chore: remove unnecessary import statements (doocs#3958)

Author: yanglbme

lcof2/剑指 Offer II 057. 值和下标之差都在给定的范围内/README.md

@@ -69,9 +69,6 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcof2/%E5%89%91%E6%8C%87%2
 #### Python3
 
 ```python
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:
         s = SortedSet()

lcof2/剑指 Offer II 057. 值和下标之差都在给定的范围内/Solution.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:
         s = SortedSet()

lcof2/剑指 Offer II 058. 日程表/README.md

@@ -65,9 +65,6 @@ MyCalendar.book(20, 30); // returns true ，第三个日程安排可以添加到
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class MyCalendar:
     def __init__(self):
         self.sd = SortedDict()
@@ -89,9 +86,6 @@ class MyCalendar:
 #### Java
 
 ```java
-import java.util.Map;
-import java.util.TreeMap;
-
 class MyCalendar {
 
     private final TreeMap<Integer, Integer> tm = new TreeMap<>();

lcof2/剑指 Offer II 058. 日程表/Solution.java

@@ -1,6 +1,3 @@
-import java.util.Map;
-import java.util.TreeMap;
-
 class MyCalendar {
 
     private final TreeMap<Integer, Integer> tm = new TreeMap<>();
@@ -25,4 +22,4 @@ public boolean book(int start, int end) {
 /**
  * Your MyCalendar object will be instantiated and called as such: MyCalendar
  * obj = new MyCalendar(); boolean param_1 = obj.book(start,end);
- */
+ */

lcof2/剑指 Offer II 058. 日程表/Solution.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedDict
-
-
 class MyCalendar:
     def __init__(self):
         self.sd = SortedDict()

lcp/LCP 24. 数字游戏/README.md

@@ -403,9 +403,6 @@ class Solution {
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class Solution:
     def numsGame(self, nums: List[int]) -> List[int]:
         l = SortedList()

lcp/LCP 24. 数字游戏/Solution2.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedList
-
-
 class Solution:
     def numsGame(self, nums: List[int]) -> List[int]:
         l = SortedList()

lcp/LCP 52. 二叉搜索树染色/README.md

@@ -89,9 +89,6 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2052.%20%E4%BA%8C%
 #         self.left = None
 #         self.right = None
 
-from sortedcontainers import SortedList
-
-
 class Solution:
     def getNumber(self, root: Optional[TreeNode], ops: List[List[int]]) -> int:
         def dfs(root):

lcp/LCP 52. 二叉搜索树染色/Solution.py

@@ -5,8 +5,6 @@
 #         self.left = None
 #         self.right = None
 
-from sortedcontainers import SortedList
-
 
 class Solution:
     def getNumber(self, root: Optional[TreeNode], ops: List[List[int]]) -> int:

solution/0200-0299/0220.Contains Duplicate III/README.md

@@ -84,9 +84,6 @@ abs(nums[i] - nums[j]) <= valueDiff --> abs(1 - 1) <= 0
 #### Python3
 
 ```python
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def containsNearbyAlmostDuplicate(
         self, nums: List[int], indexDiff: int, valueDiff: int