feat: add solutions to lc problem: No.0908

No.0908.Smallest Range I

Author: yanglbme

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

@@ -61,15 +61,68 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def smallestRangeI(self, nums: List[int], k: int) -> int:
+        mx, mi = max(nums), min(nums)
+        return max(0, mx - mi - k * 2)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int smallestRangeI(int[] nums, int k) {
+        int mx = 0;
+        int mi = 10000;
+        for (int v : nums) {
+            mx = Math.max(mx, v);
+            mi = Math.min(mi, v);
+        }
+        return Math.max(0, mx - mi - k * 2);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int smallestRangeI(vector<int>& nums, int k) {
+        int mx = *max_element(nums.begin(), nums.end());
+        int mi = *min_element(nums.begin(), nums.end());
+        return max(0, mx - mi - k * 2);
+    }
+};
+```
 
+### **Go**
+
+```go
+func smallestRangeI(nums []int, k int) int {
+	mx, mi := 0, 10000
+	for _, v := range nums {
+		mx = max(mx, v)
+		mi = min(mi, v)
+	}
+	return max(0, mx-mi-k*2)
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

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

@@ -53,13 +53,66 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def smallestRangeI(self, nums: List[int], k: int) -> int:
+        mx, mi = max(nums), min(nums)
+        return max(0, mx - mi - k * 2)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int smallestRangeI(int[] nums, int k) {
+        int mx = 0;
+        int mi = 10000;
+        for (int v : nums) {
+            mx = Math.max(mx, v);
+            mi = Math.min(mi, v);
+        }
+        return Math.max(0, mx - mi - k * 2);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int smallestRangeI(vector<int>& nums, int k) {
+        int mx = *max_element(nums.begin(), nums.end());
+        int mi = *min_element(nums.begin(), nums.end());
+        return max(0, mx - mi - k * 2);
+    }
+};
+```
 
+### **Go**
+
+```go
+func smallestRangeI(nums []int, k int) int {
+	mx, mi := 0, 10000
+	for _, v := range nums {
+		mx = max(mx, v)
+		mi = min(mi, v)
+	}
+	return max(0, mx-mi-k*2)
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    int smallestRangeI(vector<int>& nums, int k) {
+        int mx = *max_element(nums.begin(), nums.end());
+        int mi = *min_element(nums.begin(), nums.end());
+        return max(0, mx - mi - k * 2); 
+    }
+};

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

@@ -0,0 +1,22 @@
+func smallestRangeI(nums []int, k int) int {
+	mx, mi := 0, 10000
+	for _, v := range nums {
+		mx = max(mx, v)
+		mi = min(mi, v)
+	}
+	return max(0, mx-mi-k*2)
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

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

@@ -0,0 +1,11 @@
+class Solution {
+    public int smallestRangeI(int[] nums, int k) {
+        int mx = 0;
+        int mi = 10000;
+        for (int v : nums) {
+            mx = Math.max(mx, v);
+            mi = Math.min(mi, v);
+        }
+        return Math.max(0, mx - mi - k * 2);
+    }
+}

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

@@ -0,0 +1,4 @@
+class Solution:
+    def smallestRangeI(self, nums: List[int], k: int) -> int:
+        mx, mi = max(nums), min(nums)
+        return max(0, mx - mi - k * 2)