feat: add solutions to lc problem: No.0553

No.0553.Optimal Division

Author: YangFong

solution/0500-0599/0553.Optimal Division/README.md

@@ -125,6 +125,45 @@ func optimalDivision(nums []int) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function optimalDivision(nums: number[]): string {
+    const n = nums.length;
+    const res = nums.join('/');
+    if (n > 2) {
+        const index = res.indexOf('/') + 1;
+        return `${res.slice(0, index)}(${res.slice(index)})`;
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn optimal_division(nums: Vec<i32>) -> String {
+        let n = nums.len();
+        match n {
+            1 => nums[0].to_string(),
+            2 => nums[0].to_string() + "/" + &nums[1].to_string(),
+            _ => {
+                let mut res = nums[0].to_string();
+                res.push_str("/(");
+                for i in 1..n {
+                    res.push_str(&nums[i].to_string());
+                    res.push('/');
+                }
+                res.pop();
+                res.push(')');
+                res
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0553.Optimal Division/README_EN.md

@@ -133,6 +133,45 @@ func optimalDivision(nums []int) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function optimalDivision(nums: number[]): string {
+    const n = nums.length;
+    const res = nums.join('/');
+    if (n > 2) {
+        const index = res.indexOf('/') + 1;
+        return `${res.slice(0, index)}(${res.slice(index)})`;
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn optimal_division(nums: Vec<i32>) -> String {
+        let n = nums.len();
+        match n {
+            1 => nums[0].to_string(),
+            2 => nums[0].to_string() + "/" + &nums[1].to_string(),
+            _ => {
+                let mut res = nums[0].to_string();
+                res.push_str("/(");
+                for i in 1..n {
+                    res.push_str(&nums[i].to_string());
+                    res.push('/');
+                }
+                res.pop();
+                res.push(')');
+                res
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0553.Optimal Division/Solution.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn optimal_division(nums: Vec<i32>) -> String {
+        let n = nums.len();
+        match n {
+            1 => nums[0].to_string(),
+            2 => nums[0].to_string() + "/" + &nums[1].to_string(),
+            _ => {
+                let mut res = nums[0].to_string();
+                res.push_str("/(");
+                for i in 1..n {
+                    res.push_str(&nums[i].to_string());
+                    res.push('/');
+                }
+                res.pop();
+                res.push(')');
+                res
+            }
+        }
+    }
+}

solution/0500-0599/0553.Optimal Division/Solution.ts

@@ -0,0 +1,9 @@
+function optimalDivision(nums: number[]): string {
+    const n = nums.length;
+    const res = nums.join('/');
+    if (n > 2) {
+        const index = res.indexOf('/') + 1;
+        return `${res.slice(0, index)}(${res.slice(index)})`;
+    }
+    return res;
+}