feat: add solutions to lc problems: No.1588,1672

- No.1588.Sum of All Odd Length Subarrays
- No.1672.Richest Customer Wealth

Author: YangFong

solution/1500-1599/1588.Sum of All Odd Length Subarrays/README.md

@@ -143,6 +143,51 @@ func sumOddLengthSubarrays(arr []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumOddLengthSubarrays(arr: number[]): number {
+    const n = arr.length;
+    let res = 0;
+    for (let i = 1; i <= n; i += 2) {
+        let sum = 0;
+        for (let j = 0; j < i; j++) {
+            sum += arr[j];
+        }
+        res += sum;
+        for (let j = i; j < n; j++) {
+            sum -= arr[j - i];
+            sum += arr[j];
+            res += sum;
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sum_odd_length_subarrays(arr: Vec<i32>) -> i32 {
+        let n = arr.len();
+        let mut res = 0;
+        let mut i = 1;
+        while i <= n {
+            let mut sum: i32 = arr[0..i].iter().sum();
+            res += sum;
+            for j in i..n {
+                sum -= arr[j - i];
+                sum += arr[j];
+                res += sum;
+            }
+            i += 2;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1588.Sum of All Odd Length Subarrays/README_EN.md

@@ -134,6 +134,51 @@ func sumOddLengthSubarrays(arr []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumOddLengthSubarrays(arr: number[]): number {
+    const n = arr.length;
+    let res = 0;
+    for (let i = 1; i <= n; i += 2) {
+        let sum = 0;
+        for (let j = 0; j < i; j++) {
+            sum += arr[j];
+        }
+        res += sum;
+        for (let j = i; j < n; j++) {
+            sum -= arr[j - i];
+            sum += arr[j];
+            res += sum;
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sum_odd_length_subarrays(arr: Vec<i32>) -> i32 {
+        let n = arr.len();
+        let mut res = 0;
+        let mut i = 1;
+        while i <= n {
+            let mut sum: i32 = arr[0..i].iter().sum();
+            res += sum;
+            for j in i..n {
+                sum -= arr[j - i];
+                sum += arr[j];
+                res += sum;
+            }
+            i += 2;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1588.Sum of All Odd Length Subarrays/Solution.rs

@@ -0,0 +1,18 @@
+impl Solution {
+    pub fn sum_odd_length_subarrays(arr: Vec<i32>) -> i32 {
+        let n = arr.len();
+        let mut res = 0;
+        let mut i = 1;
+        while i <= n {
+            let mut sum: i32 = arr[0..i].iter().sum();
+            res += sum;
+            for j in i..n {
+                sum -= arr[j - i];
+                sum += arr[j];
+                res += sum;
+            }
+            i += 2;
+        }
+        res
+    }
+}

solution/1500-1599/1588.Sum of All Odd Length Subarrays/Solution.ts

@@ -0,0 +1,17 @@
+function sumOddLengthSubarrays(arr: number[]): number {
+    const n = arr.length;
+    let res = 0;
+    for (let i = 1; i <= n; i += 2) {
+        let sum = 0;
+        for (let j = 0; j < i; j++) {
+            sum += arr[j];
+        }
+        res += sum;
+        for (let j = i; j < n; j++) {
+            sum -= arr[j - i];
+            sum += arr[j];
+            res += sum;
+        }
+    }
+    return res;
+}

solution/1600-1699/1672.Richest Customer Wealth/README.md

@@ -117,6 +117,35 @@ func maximumWealth(accounts [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maximumWealth(accounts: number[][]): number {
+    return accounts.reduce(
+        (res, account) =>
+            Math.max(
+                res,
+                account.reduce((p, v) => p + v),
+            ),
+        0,
+    );
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn maximum_wealth(accounts: Vec<Vec<i32>>) -> i32 {
+        accounts
+            .iter()
+            .map(|account| account.iter().sum())
+            .max()
+            .unwrap()
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1672.Richest Customer Wealth/README_EN.md

@@ -110,6 +110,35 @@ func maximumWealth(accounts [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maximumWealth(accounts: number[][]): number {
+    return accounts.reduce(
+        (res, account) =>
+            Math.max(
+                res,
+                account.reduce((p, v) => p + v),
+            ),
+        0,
+    );
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn maximum_wealth(accounts: Vec<Vec<i32>>) -> i32 {
+        accounts
+            .iter()
+            .map(|account| account.iter().sum())
+            .max()
+            .unwrap()
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1672.Richest Customer Wealth/Solution.rs

@@ -0,0 +1,9 @@
+impl Solution {
+    pub fn maximum_wealth(accounts: Vec<Vec<i32>>) -> i32 {
+        accounts
+            .iter()
+            .map(|account| account.iter().sum())
+            .max()
+            .unwrap()
+    }
+}

solution/1600-1699/1672.Richest Customer Wealth/Solution.ts

@@ -0,0 +1,10 @@
+function maximumWealth(accounts: number[][]): number {
+    return accounts.reduce(
+        (res, account) =>
+            Math.max(
+                res,
+                account.reduce((p, v) => p + v),
+            ),
+        0,
+    );
+}