feat: update lc problems and solutions (#1136)

Author: yanglbme

solution/0100-0199/0176.Second Highest Salary/README_EN.md

@@ -19,9 +19,9 @@ Each row of this table contains information about the salary of an employee.
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the second highest salary from the <code>Employee</code> table. If there is no second highest salary, the query should report <code>null</code>.</p>
+<p>Find&nbsp;the second highest salary from the <code>Employee</code> table. If there is no second highest salary,&nbsp;return&nbsp;<code>null</code>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0100-0199/0177.Nth Highest Salary/README_EN.md

@@ -19,9 +19,9 @@ Each row of this table contains information about the salary of an employee.
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the <code>n<sup>th</sup></code> highest salary from the <code>Employee</code> table. If there is no <code>n<sup>th</sup></code> highest salary, the query should report <code>null</code>.</p>
+<p>Find the <code>n<sup>th</sup></code> highest salary from the <code>Employee</code> table. If there is no <code>n<sup>th</sup></code> highest salary, return&nbsp;<code>null</code>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0100-0199/0178.Rank Scores/README_EN.md

@@ -19,7 +19,7 @@ Each row of this table contains the score of a game. Score is a floating point v
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to rank the scores. The ranking should be calculated according to the following rules:</p>
+<p>Find the rank of the scores. The ranking should be calculated according to the following rules:</p>
 
 <ul>
 	<li>The scores should be ranked from the highest to the lowest.</li>
@@ -29,7 +29,7 @@ Each row of this table contains the score of a game. Score is a floating point v
 
 <p>Return the result table ordered by <code>score</code> in descending order.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0100-0199/0183.Customers Who Never Order/README_EN.md

@@ -35,11 +35,11 @@ Each row of this table indicates the ID of an order and the ID of the customer w
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report all customers who never order anything.</p>
+<p>Find all customers who never order anything.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0100-0199/0184.Department Highest Salary/README_EN.md

@@ -37,11 +37,11 @@ Each row of this table indicates the ID of a department and its name.
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to find employees who have the highest salary in each of the departments.</p>
+<p>Find employees who have the highest salary in each of the departments.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0100-0199/0196.Delete Duplicate Emails/README_EN.md

@@ -19,11 +19,11 @@ Each row of this table contains an email. The emails will not contain uppercase
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to <strong>delete</strong> all the duplicate emails, keeping only one unique email with the smallest <code>id</code>. Note that you are supposed to write a <code>DELETE</code> statement and not a <code>SELECT</code> one.</p>
+<p><strong>Delete</strong> all the duplicate emails, keeping only one unique email with the smallest <code>id</code>. (For SQL users, please note that you are supposed to write a <code>DELETE</code> statement and not a <code>SELECT</code> one.)</p>
 
 <p>After running your script, the answer shown is the <code>Person</code> table. The driver will first compile and run your piece of code and then show the <code>Person</code> table. The final order of the <code>Person</code> table <strong>does not matter</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0304.Range Sum Query 2D - Immutable/README.md

@@ -175,7 +175,7 @@ public:
  */
 
 struct NumMatrix {
-    // Of size (N + 1) * (M + 1) 
+    // Of size (N + 1) * (M + 1)
     prefix_vec: Vec<Vec<i32>>,
     n: usize,
     m: usize,
@@ -184,22 +184,22 @@ struct NumMatrix {
 }
 
 
-/** 
+/**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl NumMatrix {
 
     fn new(matrix: Vec<Vec<i32>>) -> Self {
-        NumMatrix { 
+        NumMatrix {
             prefix_vec: vec![vec![0; matrix[0].len() + 1]; matrix.len() + 1],
             n: matrix.len(),
             m: matrix[0].len(),
             is_initialized: false,
             ref_vec: matrix,
         }
     }
-    
+
     fn sum_region(&mut self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 {
         if !self.is_initialized {
             self.initialize_prefix_vec();

solution/0300-0399/0304.Range Sum Query 2D - Immutable/README_EN.md

@@ -52,7 +52,7 @@ numMatrix.sumRegion(1, 2, 2, 4); // return 12 (i.e sum of the blue rectangle)
 
 ## Solutions
 
-We use $s[i + 1][j + 1]$ to represent the sum of all elements in the upper-left part up to the $i$-th row and $j$-th column, where the indices $i$ and $j$ both start from $0$. 
+We use $s[i + 1][j + 1]$ to represent the sum of all elements in the upper-left part up to the $i$-th row and $j$-th column, where the indices $i$ and $j$ both start from $0$.
 
 We can derive the following prefix sum formula:
 
@@ -166,7 +166,7 @@ public:
  */
 
  struct NumMatrix {
-    // Of size (N + 1) * (M + 1) 
+    // Of size (N + 1) * (M + 1)
     prefix_vec: Vec<Vec<i32>>,
     n: usize,
     m: usize,
@@ -175,22 +175,22 @@ public:
 }
 
 
-/** 
+/**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl NumMatrix {
 
     fn new(matrix: Vec<Vec<i32>>) -> Self {
-        NumMatrix { 
+        NumMatrix {
             prefix_vec: vec![vec![0; matrix[0].len() + 1]; matrix.len() + 1],
             n: matrix.len(),
             m: matrix[0].len(),
             is_initialized: false,
             ref_vec: matrix,
         }
     }
-    
+
     fn sum_region(&mut self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 {
         if !self.is_initialized {
             self.initialize_prefix_vec();

solution/0300-0399/0373.Find K Pairs with Smallest Sums/README.md

@@ -6,15 +6,15 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定两个以 <strong>升序排列</strong> 的整数数组 <code>nums1</code> 和<strong> </strong><code>nums2</code><strong>&nbsp;</strong>,&nbsp;以及一个整数 <code>k</code><strong>&nbsp;</strong>。</p>
+<p>给定两个以 <strong>非递减顺序排列</strong> 的整数数组 <code>nums1</code> 和<strong> </strong><code>nums2</code><strong>&nbsp;</strong>,&nbsp;以及一个整数 <code>k</code><strong>&nbsp;</strong>。</p>
 
 <p>定义一对值&nbsp;<code>(u,v)</code>，其中第一个元素来自&nbsp;<code>nums1</code>，第二个元素来自 <code>nums2</code><strong>&nbsp;</strong>。</p>
 
 <p>请找到和最小的 <code>k</code>&nbsp;个数对&nbsp;<code>(u<sub>1</sub>,v<sub>1</sub>)</code>, <code>&nbsp;(u<sub>2</sub>,v<sub>2</sub>)</code> &nbsp;... &nbsp;<code>(u<sub>k</sub>,v<sub>k</sub>)</code>&nbsp;。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1:</strong></p>
+<p><strong class="example">示例 1:</strong></p>
 
 <pre>
 <strong>输入:</strong> nums1 = [1,7,11], nums2 = [2,4,6], k = 3
@@ -23,7 +23,7 @@
      [1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]
 </pre>
 
-<p><strong>示例 2:</strong></p>
+<p><strong class="example">示例 2:</strong></p>
 
 <pre>
 <strong>输入: </strong>nums1 = [1,1,2], nums2 = [1,2,3], k = 2
@@ -32,7 +32,7 @@
 &nbsp;    [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]
 </pre>
 
-<p><strong>示例 3:</strong></p>
+<p><strong class="example">示例 3:</strong></p>
 
 <pre>
 <strong>输入: </strong>nums1 = [1,2], nums2 = [3], k = 3 

solution/0500-0599/0511.Game Play Analysis I/README_EN.md

@@ -22,11 +22,11 @@ Each row is a record of a player who logged in and played a number of games (pos
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the <strong>first login date</strong> for each player.</p>
+<p>Find the <strong>first login date</strong> for each player.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>