feat: add solutions to lcci problem: No.10.01

No.10.01.Sorted Merge

Author: YangFong

lcci/10.01.Sorted Merge/README.md

@@ -71,6 +71,49 @@ var merge = function (A, m, B, n) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ Do not return anything, modify A in-place instead.
+ */
+function merge(A: number[], m: number, B: number[], n: number): void {
+    for (let i = n + m - 1; i >= 0; i--) {
+        const x = A[m - 1] ?? -Infinity;
+        const y = B[n - 1] ?? -Infinity;
+        if (x > y) {
+            A[i] = x;
+            m--;
+        } else {
+            A[i] = y;
+            n--;
+        }
+    }
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn merge(a: &mut Vec<i32>, m: i32, b: &mut Vec<i32>, n: i32) {
+        let mut m = m as usize;
+        let mut n = n as usize;
+        for i in (0..n + m).rev() {
+            let x = if m != 0 { a[m - 1] } else { i32::MIN };
+            let y = if n != 0 { b[n - 1] } else { i32::MIN };
+            if x > y {
+                a[i] = x;
+                m -= 1;
+            } else {
+                a[i] = y;
+                n -= 1;
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/10.01.Sorted Merge/README_EN.md

@@ -64,6 +64,50 @@ var merge = function (A, m, B, n) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ Do not return anything, modify A in-place instead.
+ */
+function merge(A: number[], m: number, B: number[], n: number): void {
+    for (let i = n + m - 1; i >= 0; i--) {
+        const x = A[m - 1] ?? -Infinity;
+        const y = B[n - 1] ?? -Infinity;
+        if (x > y) {
+            A[i] = x;
+            m--;
+        } else {
+            A[i] = y;
+            n--;
+        }
+    }
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn merge(a: &mut Vec<i32>, m: i32, b: &mut Vec<i32>, n: i32) {
+        let mut m = m as usize;
+        let mut n = n as usize;
+        for i in (0..n + m).rev() {
+            let x = if m != 0 { a[m - 1] } else { i32::MIN };
+            let y = if n != 0 { b[n - 1] } else { i32::MIN };
+            if x > y {
+                a[i] = x;
+                m -= 1;
+            } else {
+                a[i] = y;
+                n -= 1;
+            }
+        }
+    }
+}
+```
+
+
 ### **...**
 
 ```

lcci/10.01.Sorted Merge/Solution.rs

@@ -0,0 +1,17 @@
+impl Solution {
+    pub fn merge(a: &mut Vec<i32>, m: i32, b: &mut Vec<i32>, n: i32) {
+        let mut m = m as usize;
+        let mut n = n as usize;
+        for i in (0..n + m).rev() {
+            let x = if m != 0 { a[m - 1] } else { i32::MIN };
+            let y = if n != 0 { b[n - 1] } else { i32::MIN };
+            if x > y {
+                a[i] = x;
+                m -= 1;
+            } else {
+                a[i] = y;
+                n -= 1;
+            }
+        }
+    }
+}

lcci/10.01.Sorted Merge/Solution.ts

@@ -0,0 +1,16 @@
+/**
+ Do not return anything, modify A in-place instead.
+ */
+function merge(A: number[], m: number, B: number[], n: number): void {
+    for (let i = n + m - 1; i >= 0; i--) {
+        const x = A[m - 1] ?? -Infinity;
+        const y = B[n - 1] ?? -Infinity;
+        if (x > y) {
+            A[i] = x;
+            m--;
+        } else {
+            A[i] = y;
+            n--;
+        }
+    }
+}