feat: update lc problems (#3045)

Author: yanglbme

lcof2/剑指 Offer II 025. 链表中的两数相加/README.md

@@ -222,36 +222,36 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
  *     init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }
  * }
  */
- 
+
 class Solution {
     func addTwoNumbers(_ l1: ListNode?, _ l2: ListNode?) -> ListNode? {
         var s1: [Int] = []
         var s2: [Int] = []
-        
+
         var node1 = l1
         var node2 = l2
-        
+
         while let n1 = node1 {
             s1.append(n1.val)
             node1 = n1.next
         }
-        
+
         while let n2 = node2 {
             s2.append(n2.val)
             node2 = n2.next
         }
-        
+
         var carry = 0
         let dummy: ListNode? = ListNode(0)
-        
+
         while !s1.isEmpty || !s2.isEmpty || carry != 0 {
             carry += (s1.isEmpty ? 0 : s1.removeLast()) + (s2.isEmpty ? 0 : s2.removeLast())
             let node = ListNode(carry % 10)
             node.next = dummy?.next
             dummy?.next = node
             carry /= 10
         }
-        
+
         return dummy?.next
     }
 }

lcof2/剑指 Offer II 026. 重排链表/README.md

@@ -305,15 +305,15 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
 class Solution {
     func reorderList(_ head: ListNode?) {
         guard let head = head else { return }
-        
+
         let mid = middleNode(head)
-        
+
         let secondHalf = reverseList(mid.next)
         mid.next = nil
-        
+
         mergeTwoLists(head, secondHalf)
     }
-    
+
     private func middleNode(_ head: ListNode?) -> ListNode {
         var slow = head
         var fast = head
@@ -323,7 +323,7 @@ class Solution {
         }
         return slow!
     }
-    
+
     private func reverseList(_ head: ListNode?) -> ListNode? {
         var prev: ListNode? = nil
         var curr = head
@@ -335,20 +335,20 @@ class Solution {
         }
         return prev
     }
-    
+
     private func mergeTwoLists(_ l1: ListNode?, _ l2: ListNode?) {
         var l1 = l1
         var l2 = l2
         while l1 != nil && l2 != nil {
             let l1Next = l1?.next
             let l2Next = l2?.next
-            
+
             l1?.next = l2
             if l1Next == nil {
                 break
             }
             l2?.next = l1Next
-            
+
             l1 = l1Next
             l2 = l2Next
         }

lcof2/剑指 Offer II 030. 插入、删除和随机访问都是 O(1) 的容器/README.md

@@ -223,12 +223,12 @@ public:
 class RandomizedSet {
     private var m: [Int: Int]
     private var a: [Int]
-    
+
     init() {
         self.m = [Int: Int]()
         self.a = [Int]()
     }
-    
+
     func insert(_ val: Int) -> Bool {
         if m[val] != nil {
             return false
@@ -237,7 +237,7 @@ class RandomizedSet {
         a.append(val)
         return true
     }
-    
+
     func remove(_ val: Int) -> Bool {
         if let idx = m[val] {
             let last = a.count - 1
@@ -251,7 +251,7 @@ class RandomizedSet {
         }
         return false
     }
-    
+
     func getRandom() -> Int {
         return a[Int.random(in: 0..<a.count)]
     }

lcof2/剑指 Offer II 032. 有效的变位词/README.md

@@ -180,20 +180,20 @@ class Solution {
         if m != n || s == t {
             return false
         }
-        
+
         var cnt = [Int](repeating: 0, count: 26)
-        
+
         for (sc, tc) in zip(s, t) {
             cnt[Int(sc.asciiValue! - Character("a").asciiValue!)] += 1
             cnt[Int(tc.asciiValue! - Character("a").asciiValue!)] -= 1
         }
-        
+
         for x in cnt {
             if x != 0 {
                 return false
             }
         }
-        
+
         return true
     }
 }

lcof2/剑指 Offer II 033. 变位词组/README.md

@@ -164,15 +164,15 @@ function groupAnagrams(strs: string[]): string[][] {
 class Solution {
     func groupAnagrams(_ strs: [String]) -> [[String]] {
         var d = [String: [String]]()
-        
+
         for s in strs {
             let sortedStr = String(s.sorted())
             if d[sortedStr] == nil {
                 d[sortedStr] = [String]()
             }
             d[sortedStr]!.append(s)
         }
-        
+
         return Array(d.values)
     }
 }

lcof2/剑指 Offer II 034. 外星语言是否排序/README.md

@@ -205,21 +205,21 @@ function isAlienSorted(words: string[], order: string): boolean {
 class Solution {
     func isAlienSorted(_ words: [String], _ order: String) -> Bool {
         var index = [Character: Int]()
-        
+
         for (i, char) in order.enumerated() {
             index[char] = i
         }
-        
+
         for i in 0..<words.count - 1 {
             let w1 = Array(words[i])
             let w2 = Array(words[i + 1])
             let l1 = w1.count
             let l2 = w2.count
-            
+
             for j in 0..<max(l1, l2) {
                 let i1 = j >= l1 ? -1 : index[w1[j]]!
                 let i2 = j >= l2 ? -1 : index[w2[j]]!
-                
+
                 if i1 > i2 {
                     return false
                 }

lcof2/剑指 Offer II 035. 最小时间差/README.md

@@ -175,22 +175,22 @@ class Solution {
         if timePoints.count > 24 * 60 {
             return 0
         }
-        
+
         var mins = [Int]()
-        
+
         for t in timePoints {
             let time = t.split(separator: ":").map { Int($0)! }
             mins.append(time[0] * 60 + time[1])
         }
-        
+
         mins.sort()
         mins.append(mins[0] + 24 * 60)
-        
+
         var ans = Int.max
         for i in 1..<mins.count {
             ans = min(ans, mins[i] - mins[i - 1])
         }
-        
+
         return ans
     }
 }

solution/0000-0099/0088.Merge Sorted Array/README.md

@@ -157,46 +157,24 @@ function merge(nums1: number[], m: number, nums2: number[], n: number): void {
 }
 ```
 
-#### TypeScript
-
-```ts
-/**
- Do not return anything, modify nums1 in-place instead.
- */
-function merge(nums1: number[], m: number, nums2: number[], n: number): void {
-    nums1.length = m;
-    nums2.length = n;
-    nums1.push(...nums2);
-    nums1.sort((a, b) => a - b);
-}
-```
-
 #### Rust
 
 ```rust
 impl Solution {
     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
-        let (mut m, mut n) = (m as usize, n as usize);
-        for i in (0..m + n).rev() {
-            nums1[i] = match (m == 0, n == 0) {
-                (true, false) => {
-                    n -= 1;
-                    nums2[n]
-                }
-                (false, true) => {
-                    m -= 1;
-                    nums1[m]
-                }
-                (_, _) => {
-                    if nums1[m - 1] > nums2[n - 1] {
-                        m -= 1;
-                        nums1[m]
-                    } else {
-                        n -= 1;
-                        nums2[n]
-                    }
-                }
-            };
+        let mut k = (m + n - 1) as usize;
+        let mut i = (m - 1) as isize;
+        let mut j = (n - 1) as isize;
+
+        while j >= 0 {
+            if i >= 0 && nums1[i as usize] > nums2[j as usize] {
+                nums1[k] = nums1[i as usize];
+                i -= 1;
+            } else {
+                nums1[k] = nums2[j as usize];
+                j -= 1;
+            }
+            k -= 1;
         }
     }
 }

solution/0000-0099/0088.Merge Sorted Array/README_EN.md

@@ -154,46 +154,24 @@ function merge(nums1: number[], m: number, nums2: number[], n: number): void {
 }
 ```
 
-#### TypeScript
-
-```ts
-/**
- Do not return anything, modify nums1 in-place instead.
- */
-function merge(nums1: number[], m: number, nums2: number[], n: number): void {
-    nums1.length = m;
-    nums2.length = n;
-    nums1.push(...nums2);
-    nums1.sort((a, b) => a - b);
-}
-```
-
 #### Rust
 
 ```rust
 impl Solution {
     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
-        let (mut m, mut n) = (m as usize, n as usize);
-        for i in (0..m + n).rev() {
-            nums1[i] = match (m == 0, n == 0) {
-                (true, false) => {
-                    n -= 1;
-                    nums2[n]
-                }
-                (false, true) => {
-                    m -= 1;
-                    nums1[m]
-                }
-                (_, _) => {
-                    if nums1[m - 1] > nums2[n - 1] {
-                        m -= 1;
-                        nums1[m]
-                    } else {
-                        n -= 1;
-                        nums2[n]
-                    }
-                }
-            };
+        let mut k = (m + n - 1) as usize;
+        let mut i = (m - 1) as isize;
+        let mut j = (n - 1) as isize;
+
+        while j >= 0 {
+            if i >= 0 && nums1[i as usize] > nums2[j as usize] {
+                nums1[k] = nums1[i as usize];
+                i -= 1;
+            } else {
+                nums1[k] = nums2[j as usize];
+                j -= 1;
+            }
+            k -= 1;
         }
     }
 }

solution/0000-0099/0088.Merge Sorted Array/Solution.rs

@@ -1,26 +1,18 @@
 impl Solution {
     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
-        let (mut m, mut n) = (m as usize, n as usize);
-        for i in (0..m + n).rev() {
-            nums1[i] = match (m == 0, n == 0) {
-                (true, false) => {
-                    n -= 1;
-                    nums2[n]
-                }
-                (false, true) => {
-                    m -= 1;
-                    nums1[m]
-                }
-                (_, _) => {
-                    if nums1[m - 1] > nums2[n - 1] {
-                        m -= 1;
-                        nums1[m]
-                    } else {
-                        n -= 1;
-                        nums2[n]
-                    }
-                }
-            };
+        let mut k = (m + n - 1) as usize;
+        let mut i = (m - 1) as isize;
+        let mut j = (n - 1) as isize;
+
+        while j >= 0 {
+            if i >= 0 && nums1[i as usize] > nums2[j as usize] {
+                nums1[k] = nums1[i as usize];
+                i -= 1;
+            } else {
+                nums1[k] = nums2[j as usize];
+                j -= 1;
+            }
+            k -= 1;
         }
     }
 }