Merge branch 'doocs:main' into main

Author: Nothing-avil

solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md

@@ -35,7 +35,7 @@ tags:
   1->3->4,
   2->6
 ]
-merging them into one sorted list:
+merging them into one sorted linked list:
 1->1->2->3->4->4->5->6
 </pre>
 

solution/0200-0299/0282.Expression Add Operators/README_EN.md

@@ -22,6 +22,8 @@ tags:
 
 <p>Note that operands in the returned expressions <strong>should not</strong> contain leading zeros.</p>
 
+<p><strong>Note</strong> that a number can contain multiple digits.</p>
+
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 

solution/0400-0499/0405.Convert a Number to Hexadecimal/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0400-0499/0405.Co
 tags:
     - 位运算
     - 数学
+    - 字符串
 ---
 
 <!-- problem:start -->

solution/0400-0499/0405.Convert a Number to Hexadecimal/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0400-0499/0405.Co
 tags:
     - Bit Manipulation
     - Math
+    - String
 ---
 
 <!-- problem:start -->

solution/0500-0599/0504.Base 7/README.md

@@ -4,6 +4,7 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0500-0599/0504.Base%207/README.md
 tags:
     - 数学
+    - 字符串
 ---
 
 <!-- problem:start -->

solution/0500-0599/0504.Base 7/README_EN.md

@@ -4,6 +4,7 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0500-0599/0504.Base%207/README_EN.md
 tags:
     - Math
+    - String
 ---
 
 <!-- problem:start -->

solution/0600-0699/0630.Course Schedule III/README.md

@@ -179,13 +179,13 @@ func (h *hp) pop() int   { return heap.Pop(h).(int) }
 ```ts
 function scheduleCourse(courses: number[][]): number {
     courses.sort((a, b) => a[1] - b[1]);
-    const pq = new MaxPriorityQueue();
+    const pq = new MaxPriorityQueue<number>();
     let s = 0;
     for (const [duration, last] of courses) {
         pq.enqueue(duration);
         s += duration;
         while (s > last) {
-            s -= pq.dequeue().element;
+            s -= pq.dequeue();
         }
     }
     return pq.size();

solution/0600-0699/0630.Course Schedule III/README_EN.md

@@ -170,13 +170,13 @@ func (h *hp) pop() int   { return heap.Pop(h).(int) }
 ```ts
 function scheduleCourse(courses: number[][]): number {
     courses.sort((a, b) => a[1] - b[1]);
-    const pq = new MaxPriorityQueue();
+    const pq = new MaxPriorityQueue<number>();
     let s = 0;
     for (const [duration, last] of courses) {
         pq.enqueue(duration);
         s += duration;
         while (s > last) {
-            s -= pq.dequeue().element;
+            s -= pq.dequeue();
         }
     }
     return pq.size();

solution/0600-0699/0630.Course Schedule III/Solution.ts

@@ -1,12 +1,12 @@
 function scheduleCourse(courses: number[][]): number {
     courses.sort((a, b) => a[1] - b[1]);
-    const pq = new MaxPriorityQueue();
+    const pq = new MaxPriorityQueue<number>();
     let s = 0;
     for (const [duration, last] of courses) {
         pq.enqueue(duration);
         s += duration;
         while (s > last) {
-            s -= pq.dequeue().element;
+            s -= pq.dequeue();
         }
     }
     return pq.size();

solution/0800-0899/0871.Minimum Number of Refueling Stops/README.md

@@ -206,14 +206,14 @@ func (h *hp) Pop() any {
 
 ```ts
 function minRefuelStops(target: number, startFuel: number, stations: number[][]): number {
-    const pq = new MaxPriorityQueue();
+    const pq = new MaxPriorityQueue<number>();
     let [ans, pre] = [0, 0];
     stations.push([target, 0]);
     for (const [pos, fuel] of stations) {
         const dist = pos - pre;
         startFuel -= dist;
         while (startFuel < 0 && !pq.isEmpty()) {
-            startFuel += pq.dequeue().element;
+            startFuel += pq.dequeue();
             ans++;
         }
         if (startFuel < 0) {