Dec 22

Author: GSNCodes

December_LeetCode_Challenge/Smallest_Range_II.py

@@ -0,0 +1,47 @@
+Given an array A of integers, for each integer A[i] we need to choose 
+either x = -K or x = K, and add x to A[i] (only once).
+
+After this process, we have some array B.
+
+Return the smallest possible difference between the maximum value of B 
+and the minimum value of B.
+
+ 
+Example 1:
+Input: A = [1], K = 0
+Output: 0
+Explanation: B = [1]
+
+Example 2:
+Input: A = [0,10], K = 2
+Output: 6
+Explanation: B = [2,8]
+
+Example 3:
+Input: A = [1,3,6], K = 3
+Output: 3
+Explanation: B = [4,6,3]
+ 
+
+Note:
+1 <= A.length <= 10000
+0 <= A[i] <= 10000
+0 <= K <= 10000
+
+
+# O(nlogn) Time and O(1) Space
+class Solution:
+    def smallestRangeII(self, A: List[int], K: int) -> int:
+        
+        A.sort()
+        
+        result = A[-1] - A[0]
+        
+        for i in range(len(A)-1):
+            
+            max_val = max(A[i] + K, A[-1] - K)
+            min_val = min(A[0] + K, A[i+1] - K)
+            
+            result = min(result, max_val - min_val)
+            
+        return result