Parcourir la source

Adding even faster solution for 2006

Vinicius Teshima il y a 6 jours
Parent
commit
5d7d142ba7
1 fichiers modifiés avec 14 ajouts et 10 suppressions
  1. 14 10
      Python/2006.py

+ 14 - 10
Python/2006.py

@@ -6,16 +6,20 @@ from typing import List
 
 class Solution:
     def countKDifference(self, nums: List[int], k: int) -> int:
-        return sum(
-            len(
-                [
-                    1
-                    for j in range(len(nums))
-                    if i < j and abs(nums[i] - nums[j]) == k
-                ]
-            )
-            for i in range(len(nums))
-        )
+        r: int = 0
+        i: int = 0
+        l: int = len(nums)
+        while i < l:
+            j: int = i
+            while j < l:
+                if abs(nums[i] - nums[j]) == k:
+                    r += 1
+                    pass
+                j += 1
+                pass
+            i += 1
+            pass
+        return r
     pass