Runtime: 2682 ms (Top 14.06%) | Memory: 30 MB (Top 26.09%)

Author: AnasImloul

scripts/algorithms/M/Minimum Absolute Sum Difference/Minimum Absolute Sum Difference.py

@@ -1,24 +1,25 @@
+# Runtime: 2682 ms (Top 14.06%) | Memory: 30 MB (Top 26.09%)
 class Solution:
-	def minAbsoluteSumDiff(self, nums1: List[int], nums2: List[int]) -> int:
-		n = len(nums1)
-		diff = []
-		sum = 0
-		for i in range(n):
-			temp = abs(nums1[i]-nums2[i])
-			diff.append(temp)
-			sum += temp
-		nums1.sort()
-		best_diff = []
-		for i in range(n):
-			idx = bisect.bisect_left(nums1, nums2[i])
-			if idx != 0 and idx != n:
-				best_diff.append(
-					min(abs(nums2[i]-nums1[idx]), abs(nums2[i]-nums1[idx-1])))
-			elif idx == 0:
-				best_diff.append(abs(nums2[i]-nums1[idx]))
-			else:
-				best_diff.append(abs(nums2[i]-nums1[idx-1]))
-		saved = 0
-		for i in range(n):
-			saved = max(saved, diff[i]-best_diff[i])
-		return (sum-saved) % ((10**9)+(7))
+    def minAbsoluteSumDiff(self, nums1: List[int], nums2: List[int]) -> int:
+        n = len(nums1)
+        diff = []
+        sum = 0
+        for i in range(n):
+            temp = abs(nums1[i]-nums2[i])
+            diff.append(temp)
+            sum += temp
+        nums1.sort()
+        best_diff = []
+        for i in range(n):
+            idx = bisect.bisect_left(nums1, nums2[i])
+            if idx != 0 and idx != n:
+                best_diff.append(
+                    min(abs(nums2[i]-nums1[idx]), abs(nums2[i]-nums1[idx-1])))
+            elif idx == 0:
+                best_diff.append(abs(nums2[i]-nums1[idx]))
+            else:
+                best_diff.append(abs(nums2[i]-nums1[idx-1]))
+        saved = 0
+        for i in range(n):
+            saved = max(saved, diff[i]-best_diff[i])
+        return (sum-saved) % ((10**9)+(7))