feat: add solutions to lc problem: No.0011

No.0011.Container With Most Water

Author: YangFong

solution/0000-0099/0011.Container With Most Water/README.md

@@ -174,6 +174,45 @@ var maxArea = function (height) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function maxArea(height: number[]): number {
+    const n = height.length;
+    let res = 0;
+    for (let i = 0; i < n - 1; i++) {
+        for (let j = n - 1; j >= 0; j--) {
+            if (height[i] * (j - i) < res) {
+                break;
+            }
+            res = Math.max(res, Math.min(height[i], height[j]) * (j - i));
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_area(height: Vec<i32>) -> i32 {
+        let mut i = 0;
+        let mut j = height.len() - 1;
+        let mut res = 0;
+        while i < j {
+            res = res.max(height[i].min(height[j]) * (j - i) as i32);
+            if height[i] <= height[j] {
+                i += 1;
+            } else {
+                j -= 1;
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0011.Container With Most Water/README_EN.md

@@ -149,6 +149,45 @@ var maxArea = function (height) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function maxArea(height: number[]): number {
+    const n = height.length;
+    let res = 0;
+    for (let i = 0; i < n - 1; i++) {
+        for (let j = n - 1; j >= 0; j--) {
+            if (height[i] * (j - i) < res) {
+                break;
+            }
+            res = Math.max(res, Math.min(height[i], height[j]) * (j - i));
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_area(height: Vec<i32>) -> i32 {
+        let mut i = 0;
+        let mut j = height.len() - 1;
+        let mut res = 0;
+        while i < j {
+            res = res.max(height[i].min(height[j]) * (j - i) as i32);
+            if height[i] <= height[j] {
+                i += 1;
+            } else {
+                j -= 1;
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0011.Container With Most Water/Solution.rs

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn max_area(height: Vec<i32>) -> i32 {
+        let mut i = 0;
+        let mut j = height.len() - 1;
+        let mut res = 0;
+        while i < j {
+            res = res.max(height[i].min(height[j]) * (j - i) as i32);
+            if height[i] <= height[j] {
+                i += 1;
+            } else {
+                j -= 1;
+            }
+        }
+        res
+    }
+}

solution/0000-0099/0011.Container With Most Water/Solution.ts

@@ -0,0 +1,13 @@
+function maxArea(height: number[]): number {
+    const n = height.length;
+    let res = 0;
+    for (let i = 0; i < n - 1; i++) {
+        for (let j = n - 1; j >= 0; j--) {
+            if (height[i] * (j - i) < res) {
+                break;
+            }
+            res = Math.max(res, Math.min(height[i], height[j]) * (j - i));
+        }
+    }
+    return res;
+}