feat: add solutions to lc problem: No.0120

No.0120.Triangle

Author: YangFong

solution/0100-0199/0120.Triangle/README.md

@@ -144,6 +144,39 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minimumTotal(triangle: number[][]): number {
+    const n = triangle.length;
+    for (let i = n - 2; i >= 0; i--) {
+        for (let j = 0; j < i + 1; j++) {
+            triangle[i][j] += Math.min(
+                triangle[i + 1][j],
+                triangle[i + 1][j + 1],
+            );
+        }
+    }
+    return triangle[0][0];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn minimum_total(mut triangle: Vec<Vec<i32>>) -> i32 {
+        let n = triangle.len();
+        for i in (0..n - 1).rev() {
+            for j in 0..i + 1 {
+                triangle[i][j] += triangle[i + 1][j].min(triangle[i + 1][j + 1]);
+            }
+        }
+        triangle[0][0]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0120.Triangle/README_EN.md

@@ -127,6 +127,39 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minimumTotal(triangle: number[][]): number {
+    const n = triangle.length;
+    for (let i = n - 2; i >= 0; i--) {
+        for (let j = 0; j < i + 1; j++) {
+            triangle[i][j] += Math.min(
+                triangle[i + 1][j],
+                triangle[i + 1][j + 1],
+            );
+        }
+    }
+    return triangle[0][0];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn minimum_total(mut triangle: Vec<Vec<i32>>) -> i32 {
+        let n = triangle.len();
+        for i in (0..n - 1).rev() {
+            for j in 0..i + 1 {
+                triangle[i][j] += triangle[i + 1][j].min(triangle[i + 1][j + 1]);
+            }
+        }
+        triangle[0][0]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0120.Triangle/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn minimum_total(mut triangle: Vec<Vec<i32>>) -> i32 {
+        let n = triangle.len();
+        for i in (0..n - 1).rev() {
+            for j in 0..i + 1 {
+                triangle[i][j] += triangle[i + 1][j].min(triangle[i + 1][j + 1]);
+            }
+        }
+        triangle[0][0]
+    }
+}

solution/0100-0199/0120.Triangle/Solution.ts

@@ -0,0 +1,12 @@
+function minimumTotal(triangle: number[][]): number {
+    const n = triangle.length;
+    for (let i = n - 2; i >= 0; i--) {
+        for (let j = 0; j < i + 1; j++) {
+            triangle[i][j] += Math.min(
+                triangle[i + 1][j],
+                triangle[i + 1][j + 1],
+            );
+        }
+    }
+    return triangle[0][0];
+}