[pull] main from doocs:main

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

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

@@ -82,9 +82,6 @@ The time complexity is $O(n \times \log k)$, where $n$ is the length of the arra
 #### Python3
 
 ```python
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def containsNearbyAlmostDuplicate(
         self, nums: List[int], indexDiff: int, valueDiff: int

solution/0200-0299/0220.Contains Duplicate III/Solution.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def containsNearbyAlmostDuplicate(
         self, nums: List[int], indexDiff: int, valueDiff: int

solution/0200-0299/0225.Implement Stack using Queues/README.md

@@ -126,8 +126,6 @@ class MyStack:
 #### Java
 
 ```java
-import java.util.Deque;
-
 class MyStack {
     private Deque<Integer> q1 = new ArrayDeque<>();
     private Deque<Integer> q2 = new ArrayDeque<>();

solution/0200-0299/0225.Implement Stack using Queues/README_EN.md

@@ -121,8 +121,6 @@ class MyStack:
 #### Java
 
 ```java
-import java.util.Deque;
-
 class MyStack {
     private Deque<Integer> q1 = new ArrayDeque<>();
     private Deque<Integer> q2 = new ArrayDeque<>();

solution/0200-0299/0225.Implement Stack using Queues/Solution.java

@@ -1,5 +1,3 @@
-import java.util.Deque;
-
 class MyStack {
     private Deque<Integer> q1 = new ArrayDeque<>();
     private Deque<Integer> q2 = new ArrayDeque<>();
@@ -37,4 +35,4 @@ public boolean empty() {
  * int param_2 = obj.pop();
  * int param_3 = obj.top();
  * boolean param_4 = obj.empty();
- */
+ */

solution/0300-0399/0352.Data Stream as Disjoint Intervals/README.md

@@ -83,9 +83,6 @@ summaryRanges.getIntervals(); // 返回 [[1, 3], [6, 7]]
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class SummaryRanges:
     def __init__(self):
         self.mp = SortedDict()

solution/0300-0399/0352.Data Stream as Disjoint Intervals/README_EN.md

@@ -77,9 +77,6 @@ summaryRanges.getIntervals(); // return [[1, 3], [6, 7]]
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class SummaryRanges:
     def __init__(self):
         self.mp = SortedDict()

solution/0300-0399/0352.Data Stream as Disjoint Intervals/Solution.py

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

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/README.md

@@ -76,9 +76,6 @@ tags:
 #### Python3
 
 ```python
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def maxSumSubmatrix(self, matrix: List[List[int]], k: int) -> int:
         m, n = len(matrix), len(matrix[0])

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/README_EN.md

@@ -73,9 +73,6 @@ The time complexity is $O(m^2 \times n \times \log n)$, and the space complexity
 #### Python3
 
 ```python
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def maxSumSubmatrix(self, matrix: List[List[int]], k: int) -> int:
         m, n = len(matrix), len(matrix[0])

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/Solution.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedSet
-
-
 class Solution:
     def maxSumSubmatrix(self, matrix: List[List[int]], k: int) -> int:
         m, n = len(matrix), len(matrix[0])

solution/0400-0499/0480.Sliding Window Median/README.md

@@ -466,9 +466,6 @@ func (h *hp) Pop() any {
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class Solution:
     def medianSlidingWindow(self, nums: List[int], k: int) -> List[float]:
         l = SortedList()

solution/0400-0499/0480.Sliding Window Median/README_EN.md

@@ -36,7 +36,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [1,3,-1,-3,5,3,6,7], k = 3
 <strong>Output:</strong> [1.00000,-1.00000,-1.00000,3.00000,5.00000,6.00000]
-<strong>Explanation:</strong> 
+<strong>Explanation:</strong>
 Window position                Median
 ---------------                -----
 [<strong>1  3  -1</strong>] -3  5  3  6  7        1
@@ -470,9 +470,6 @@ The time complexity is $O(n \log k)$, and the space complexity is $O(k)$. Here,
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class Solution:
     def medianSlidingWindow(self, nums: List[int], k: int) -> List[float]:
         l = SortedList()

solution/0400-0499/0480.Sliding Window Median/Solution2.py

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

solution/0700-0799/0716.Max Stack/README.md

@@ -98,9 +98,6 @@ stk.top();     // 返回 5，[<strong>5</strong>] - 栈没有改变
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class Node:
     def __init__(self, val=0):
         self.val = val

solution/0700-0799/0716.Max Stack/README_EN.md

@@ -80,9 +80,6 @@ stk.top();     // return 5, [<strong><u>5</u></strong>] the stack did not change
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class Node:
     def __init__(self, val=0):
         self.val = val

solution/0700-0799/0716.Max Stack/Solution.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedList
-
-
 class Node:
     def __init__(self, val=0):
         self.val = val

solution/0700-0799/0729.My Calendar I/README.md

@@ -78,9 +78,6 @@ myCalendar.book(20, 30); // return True ，这个日程安排可以添加到日
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class MyCalendar:
 
     def __init__(self):

solution/0700-0799/0729.My Calendar I/README_EN.md

@@ -70,9 +70,6 @@ myCalendar.book(20, 30); // return True, The event can be booked, as the first e
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class MyCalendar:
 
     def __init__(self):

solution/0700-0799/0729.My Calendar I/Solution.py

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

solution/0700-0799/0731.My Calendar II/README.md

@@ -81,9 +81,6 @@ myCalendarTwo.book(25, 55); // 返回 True，能够预定该日程，因为时
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class MyCalendarTwo:
 
     def __init__(self):

solution/0700-0799/0731.My Calendar II/README_EN.md

@@ -46,9 +46,9 @@ tags:
 
 <strong>Explanation</strong>
 MyCalendarTwo myCalendarTwo = new MyCalendarTwo();
-myCalendarTwo.book(10, 20); // return True, The event can be booked. 
-myCalendarTwo.book(50, 60); // return True, The event can be booked. 
-myCalendarTwo.book(10, 40); // return True, The event can be double booked. 
+myCalendarTwo.book(10, 20); // return True, The event can be booked.
+myCalendarTwo.book(50, 60); // return True, The event can be booked.
+myCalendarTwo.book(10, 40); // return True, The event can be double booked.
 myCalendarTwo.book(5, 15);  // return False, The event cannot be booked, because it would result in a triple booking.
 myCalendarTwo.book(5, 10); // return True, The event can be booked, as it does not use time 10 which is already double booked.
 myCalendarTwo.book(25, 55); // return True, The event can be booked, as the time in [25, 40) will be double booked with the third event, the time [40, 50) will be single booked, and the time [50, 55) will be double booked with the second event.
@@ -79,9 +79,6 @@ The time complexity is $O(n^2)$, and the space complexity is $O(n)$, where $n$ i
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class MyCalendarTwo:
 
     def __init__(self):

solution/0700-0799/0731.My Calendar II/Solution.py

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

solution/0800-0899/0846.Hand of Straights/README.md

@@ -213,9 +213,6 @@ function isNStraightHand(hand: number[], groupSize: number) {
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class Solution:
     def isNStraightHand(self, hand: List[int], groupSize: int) -> bool:
         if len(hand) % groupSize != 0:

solution/0800-0899/0846.Hand of Straights/README_EN.md

@@ -198,9 +198,6 @@ function isNStraightHand(hand: number[], groupSize: number) {
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class Solution:
     def isNStraightHand(self, hand: List[int], groupSize: int) -> bool:
         if len(hand) % groupSize != 0:

solution/0800-0899/0846.Hand of Straights/Solution2.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedDict
-
-
 class Solution:
     def isNStraightHand(self, hand: List[int], groupSize: int) -> bool:
         if len(hand) % groupSize != 0:

solution/0800-0899/0855.Exam Room/README.md

@@ -81,9 +81,6 @@ examRoom.seat(); // 返回 5，学生最后坐在 5 号座位。
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class ExamRoom:
     def __init__(self, n: int):
         def dist(x):

solution/0800-0899/0855.Exam Room/README_EN.md

@@ -81,9 +81,6 @@ The time complexity is $O(\log n)$, and the space complexity is $O(n)$. Here, $n
 #### Python3
 
 ```python
-from sortedcontainers import SortedList
-
-
 class ExamRoom:
     def __init__(self, n: int):
         def dist(x):

solution/0800-0899/0855.Exam Room/Solution.py

@@ -1,6 +1,3 @@
-from sortedcontainers import SortedList
-
-
 class ExamRoom:
     def __init__(self, n: int):
         def dist(x):

solution/0900-0999/0975.Odd Even Jump/README.md

@@ -110,9 +110,6 @@ tags:
 #### Python3
 
 ```python
-from sortedcontainers import SortedDict
-
-
 class Solution:
     def oddEvenJumps(self, arr: List[int]) -> int:
         @cache