feat: add solutions to lc problem: No.0396

No.0396.Rotate Function

Author: YangFong

solution/0300-0399/0396.Rotate Function/README.md

@@ -147,6 +147,42 @@ func maxRotateFunction(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxRotateFunction(nums: number[]): number {
+    const n = nums.length;
+    const sum = nums.reduce((r, v) => r + v);
+    let res = nums.reduce((r, v, i) => r + v * i, 0);
+    let pre = res;
+    for (let i = 1; i < n; i++) {
+        pre = pre - (sum - nums[i - 1]) + nums[i - 1] * (n - 1);
+        res = Math.max(res, pre);
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_rotate_function(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let sum: i32 = nums.iter().sum();
+        let mut pre: i32 = nums.iter().enumerate().map(|(i, &v)| i as i32 * v).sum();
+        (0..n)
+            .map(|i| {
+                let res = pre;
+                pre = pre - (sum - nums[i]) + nums[i] * (n - 1) as i32;
+                res
+            })
+            .max()
+            .unwrap_or(0)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0300-0399/0396.Rotate Function/README_EN.md

@@ -129,6 +129,42 @@ func maxRotateFunction(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxRotateFunction(nums: number[]): number {
+    const n = nums.length;
+    const sum = nums.reduce((r, v) => r + v);
+    let res = nums.reduce((r, v, i) => r + v * i, 0);
+    let pre = res;
+    for (let i = 1; i < n; i++) {
+        pre = pre - (sum - nums[i - 1]) + nums[i - 1] * (n - 1);
+        res = Math.max(res, pre);
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_rotate_function(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let sum: i32 = nums.iter().sum();
+        let mut pre: i32 = nums.iter().enumerate().map(|(i, &v)| i as i32 * v).sum();
+        (0..n)
+            .map(|i| {
+                let res = pre;
+                pre = pre - (sum - nums[i]) + nums[i] * (n - 1) as i32;
+                res
+            })
+            .max()
+            .unwrap_or(0)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0300-0399/0396.Rotate Function/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn max_rotate_function(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let sum: i32 = nums.iter().sum();
+        let mut pre: i32 = nums.iter().enumerate().map(|(i, &v)| i as i32 * v).sum();
+        (0..n)
+            .map(|i| {
+                let res = pre;
+                pre = pre - (sum - nums[i]) + nums[i] * (n - 1) as i32;
+                res
+            })
+            .max()
+            .unwrap_or(0)
+    }
+}

solution/0300-0399/0396.Rotate Function/Solution.ts

@@ -0,0 +1,11 @@
+function maxRotateFunction(nums: number[]): number {
+    const n = nums.length;
+    const sum = nums.reduce((r, v) => r + v);
+    let res = nums.reduce((r, v, i) => r + v * i, 0);
+    let pre = res;
+    for (let i = 1; i < n; i++) {
+        pre = pre - (sum - nums[i - 1]) + nums[i - 1] * (n - 1);
+        res = Math.max(res, pre);
+    }
+    return res;
+}