feat: add solutions to lc problem: No.0908

No.0908.Smallest Range I

Author: YangFong

solution/0900-0999/0908.Smallest Range I/README.md

@@ -125,6 +125,28 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function smallestRangeI(nums: number[], k: number): number {
+    const max = nums.reduce((r, v) => Math.max(r, v));
+    const min = nums.reduce((r, v) => Math.min(r, v));
+    return Math.max(max - min - k * 2, 0);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn smallest_range_i(nums: Vec<i32>, k: i32) -> i32 {
+        let max = nums.iter().max().unwrap();
+        let min = nums.iter().min().unwrap();
+        0.max(max - min - k * 2)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0908.Smallest Range I/README_EN.md

@@ -115,6 +115,28 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function smallestRangeI(nums: number[], k: number): number {
+    const max = nums.reduce((r, v) => Math.max(r, v));
+    const min = nums.reduce((r, v) => Math.min(r, v));
+    return Math.max(max - min - k * 2, 0);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn smallest_range_i(nums: Vec<i32>, k: i32) -> i32 {
+        let max = nums.iter().max().unwrap();
+        let min = nums.iter().min().unwrap();
+        0.max(max - min - k * 2)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0908.Smallest Range I/Solution.rs

@@ -0,0 +1,7 @@
+impl Solution {
+    pub fn smallest_range_i(nums: Vec<i32>, k: i32) -> i32 {
+        let max = nums.iter().max().unwrap();
+        let min = nums.iter().min().unwrap();
+        0.max(max - min - k * 2)
+    }
+}

solution/0900-0999/0908.Smallest Range I/Solution.ts

@@ -0,0 +1,5 @@
+function smallestRangeI(nums: number[], k: number): number {
+    const max = nums.reduce((r, v) => Math.max(r, v));
+    const min = nums.reduce((r, v) => Math.min(r, v));
+    return Math.max(max - min - k * 2, 0);
+}