Runtime: 492 ms (Top 22.46%) | Memory: 20 MB (Top 17.02%)

Author: AnasImloul

scripts/algorithms/C/Construct Target Array With Multiple Sums/Construct Target Array With Multiple Sums.py

@@ -1,3 +1,4 @@
+# Runtime: 492 ms (Top 22.46%) | Memory: 20 MB (Top 17.02%)
 class Solution:
     def isPossible(self, target: List[int]) -> bool:
         if len(target) == 1:
@@ -8,13 +9,13 @@ def isPossible(self, target: List[int]) -> bool:
         while heap[0]<-1:
             maximum = -heappop(heap)
             res -= maximum
-            
+
             if res == 1:
                 return True
             x = maximum % res
             if x == 0 or (x != 1 and x == maximum):
                 return False
-            
+
             res += x
             heappush(heap,-x)
-        return True
+        return True