feat: update lc problems

Author: yanglbme

lcci/01.02.Check Permutation/README.md

@@ -168,7 +168,7 @@ func CheckPermutation(s1 string, s2 string) bool {
  * @param {string} s2
  * @return {boolean}
  */
-var CheckPermutation = function(s1, s2) {
+var CheckPermutation = function (s1, s2) {
     if (s1.length != s2.length) {
         return false;
     }

lcci/01.02.Check Permutation/README_EN.md

@@ -148,7 +148,7 @@ func CheckPermutation(s1 string, s2 string) bool {
  * @param {string} s2
  * @return {boolean}
  */
-var CheckPermutation = function(s1, s2) {
+var CheckPermutation = function (s1, s2) {
     if (s1.length != s2.length) {
         return false;
     }

lcci/03.02.Min Stack/README.md

@@ -301,21 +301,21 @@ public class MinStack {
     public MinStack() {
         stk2.Push(int.MaxValue);
     }
-    
+
     public void Push(int x) {
         stk1.Push(x);
         stk2.Push(Math.Min(x, GetMin()));
     }
-    
+
     public void Pop() {
         stk1.Pop();
         stk2.Pop();
     }
-    
+
     public int Top() {
         return stk1.Peek();
     }
-    
+
     public int GetMin() {
         return stk2.Peek();
     }

lcci/03.02.Min Stack/README_EN.md

@@ -73,21 +73,21 @@ class MinStack {
     public MinStack() {
         stk2.push(Integer.MAX_VALUE);
     }
-    
+
     public void push(int x) {
         stk1.push(x);
         stk2.push(Math.min(x, stk2.peek()));
     }
-    
+
     public void pop() {
         stk1.pop();
         stk2.pop();
     }
-    
+
     public int top() {
         return stk1.peek();
     }
-    
+
     public int getMin() {
         return stk2.peek();
     }
@@ -194,7 +194,6 @@ func min(a, b int) int {
  */
 ```
 
-
 ### **TypeScript**
 
 ```ts
@@ -301,21 +300,21 @@ public class MinStack {
     public MinStack() {
         stk2.Push(int.MaxValue);
     }
-    
+
     public void Push(int x) {
         stk1.Push(x);
         stk2.Push(Math.Min(x, GetMin()));
     }
-    
+
     public void Pop() {
         stk1.Pop();
         stk2.Pop();
     }
-    
+
     public int Top() {
         return stk1.Peek();
     }
-    
+
     public int GetMin() {
         return stk2.Peek();
     }

lcci/04.02.Minimum Height Tree/README_EN.md

@@ -51,7 +51,7 @@ class Solution:
                 return None
             mid = (l + r) >> 1
             return TreeNode(nums[mid], dfs(l, mid - 1), dfs(mid + 1, r))
-        
+
         return dfs(0, len(nums) - 1)
 ```
 

lcci/17.20.Continuous Median/README_EN.md

@@ -82,15 +82,15 @@ class MedianFinder {
     public MedianFinder() {
 
     }
-    
+
     public void addNum(int num) {
         q1.offer(num);
         q2.offer(q1.poll());
         if (q2.size() - q1.size() > 1) {
             q1.offer(q2.poll());
         }
     }
-    
+
     public double findMedian() {
         if (q2.size() > q1.size()) {
             return q2.peek();
@@ -116,7 +116,7 @@ public:
     MedianFinder() {
 
     }
-    
+
     void addNum(int num) {
         q1.push(num);
         q2.push(q1.top());
@@ -126,7 +126,7 @@ public:
             q2.pop();
         }
     }
-    
+
     double findMedian() {
         if (q2.size() > q1.size()) {
             return q2.top();

solution/0000-0099/0016.3Sum Closest/README_EN.md

@@ -11,19 +11,20 @@
 <p>You may assume that each input would have exactly one solution.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [-1,2,1,-4], target = 1
 <strong>Output:</strong> 2
 <strong>Explanation:</strong> The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [0,0,0], target = 1
 <strong>Output:</strong> 0
+<strong>Explanation:</strong> The sum that is closest to the target is 0. (0 + 0 + 0 = 0).
 </pre>
 
 <p>&nbsp;</p>

solution/0000-0099/0045.Jump Game II/README_EN.md

@@ -4,13 +4,16 @@
 
 ## Description
 
-<p>Given an array of non-negative integers <code>nums</code>, you are initially positioned at the first index of the array.</p>
+<p>You are given a <strong>0-indexed</strong> array of integers <code>nums</code> of length <code>n</code>. You are initially positioned at <code>nums[0]</code>.</p>
 
-<p>Each element in the array represents your maximum jump length at that position.</p>
+<p>Each element <code>nums[i]</code> represents the maximum length of a forward jump from index <code>i</code>. In other words, if you are at <code>nums[i]</code>, you can jump to any <code>nums[i + j]</code> where:</p>
 
-<p>Your goal is to reach the last index in the minimum number of jumps.</p>
+<ul>
+	<li><code>1 &lt;= j &lt;= nums[i]</code> and</li>
+	<li><code>i + j &lt; n</code></li>
+</ul>
 
-<p>You can assume that you can always reach the last index.</p>
+<p>Return <em>the minimum number of jumps to reach </em><code>nums[n - 1]</code>. The test cases are generated such that you can reach <code>nums[n - 1]</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>

solution/0100-0199/0155.Min Stack/README.md

@@ -345,21 +345,21 @@ public class MinStack {
     public MinStack() {
         stk2.Push(int.MaxValue);
     }
-    
+
     public void Push(int x) {
         stk1.Push(x);
         stk2.Push(Math.Min(x, GetMin()));
     }
-    
+
     public void Pop() {
         stk1.Pop();
         stk2.Pop();
     }
-    
+
     public int Top() {
         return stk1.Peek();
     }
-    
+
     public int GetMin() {
         return stk2.Peek();
     }

solution/0100-0199/0155.Min Stack/README_EN.md

@@ -96,21 +96,21 @@ class MinStack {
     public MinStack() {
         stk2.push(Integer.MAX_VALUE);
     }
-    
+
     public void push(int x) {
         stk1.push(x);
         stk2.push(Math.min(x, stk2.peek()));
     }
-    
+
     public void pop() {
         stk1.pop();
         stk2.pop();
     }
-    
+
     public int top() {
         return stk1.peek();
     }
-    
+
     public int getMin() {
         return stk2.peek();
     }
@@ -217,7 +217,6 @@ func min(a, b int) int {
  */
 ```
 
-
 ### **TypeScript**
 
 ```ts
@@ -324,21 +323,21 @@ public class MinStack {
     public MinStack() {
         stk2.Push(int.MaxValue);
     }
-    
+
     public void Push(int x) {
         stk1.Push(x);
         stk2.Push(Math.Min(x, GetMin()));
     }
-    
+
     public void Pop() {
         stk1.Pop();
         stk2.Pop();
     }
-    
+
     public int Top() {
         return stk1.Peek();
     }
-    
+
     public int GetMin() {
         return stk2.Peek();
     }