feat: add solutions to lc problem: No.2104

YangFong · YangFong · commit 6e01a04fbe98 · 2022-03-04T09:26:17.000+08:00
No.2104.Sum of Subarray Ranges
diff --git a/solution/2100-2199/2104.Sum of Subarray Ranges/README.md b/solution/2100-2199/2104.Sum of Subarray Ranges/README.md
@@ -165,10 +165,42 @@ func min(a, b int) int {
 
 ### **TypeScript**
 
-<!-- 这里可写当前语言的特殊实现逻辑 -->
-
 ```ts
+function subArrayRanges(nums: number[]): number {
+    const n = nums.length;
+    let res = 0;
+    for (let i = 0; i < n - 1; i++) {
+        let min = nums[i];
+        let max = nums[i];
+        for (let j = i + 1; j < n; j++) {
+            min = Math.min(min, nums[j]);
+            max = Math.max(max, nums[j]);
+            res += max - min;
+        }
+    }
+    return res;
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sub_array_ranges(nums: Vec<i32>) -> i64 {
+        let n = nums.len();
+        let mut res: i64 = 0;
+        for i in 1..n {
+            let mut min = nums[i - 1];
+            let mut max = nums[i - 1];
+            for j in i..n {
+                min = min.min(nums[j]);
+                max = max.max(nums[j]);
+                res += (max - min) as i64;
+            }
+        }
+        res
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/2100-2199/2104.Sum of Subarray Ranges/README_EN.md b/solution/2100-2199/2104.Sum of Subarray Ranges/README_EN.md
@@ -153,7 +153,41 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
+function subArrayRanges(nums: number[]): number {
+    const n = nums.length;
+    let res = 0;
+    for (let i = 0; i < n - 1; i++) {
+        let min = nums[i];
+        let max = nums[i];
+        for (let j = i + 1; j < n; j++) {
+            min = Math.min(min, nums[j]);
+            max = Math.max(max, nums[j]);
+            res += max - min;
+        }
+    }
+    return res;
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sub_array_ranges(nums: Vec<i32>) -> i64 {
+        let n = nums.len();
+        let mut res: i64 = 0;
+        for i in 1..n {
+            let mut min = nums[i - 1];
+            let mut max = nums[i - 1];
+            for j in i..n {
+                min = min.min(nums[j]);
+                max = max.max(nums[j]);
+                res += (max - min) as i64;
+            }
+        }
+        res
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/2100-2199/2104.Sum of Subarray Ranges/Solution.rs b/solution/2100-2199/2104.Sum of Subarray Ranges/Solution.rs
@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn sub_array_ranges(nums: Vec<i32>) -> i64 {
+        let n = nums.len();
+        let mut res: i64 = 0;
+        for i in 1..n {
+            let mut min = nums[i - 1];
+            let mut max = nums[i - 1];
+            for j in i..n {
+                min = min.min(nums[j]);
+                max = max.max(nums[j]);
+                res += (max - min) as i64;
+            }
+        }
+        res
+    }
+}
diff --git a/solution/2100-2199/2104.Sum of Subarray Ranges/Solution.ts b/solution/2100-2199/2104.Sum of Subarray Ranges/Solution.ts
@@ -0,0 +1,14 @@
+function subArrayRanges(nums: number[]): number {
+    const n = nums.length;
+    let res = 0;
+    for (let i = 0; i < n - 1; i++) {
+        let min = nums[i];
+        let max = nums[i];
+        for (let j = i + 1; j < n; j++) {
+            min = Math.min(min, nums[j]);
+            max = Math.max(max, nums[j]);
+            res += max - min;
+        }
+    }
+    return res;
+}
