Runtime: 5248 ms (Top 5.11%) | Memory: 68.3 MB (Top 89.11%)

Author: AnasImloul

scripts/algorithms/F/Find Players With Zero or One Losses/Find Players With Zero or One Losses.py

@@ -1,14 +1,15 @@
+# Runtime: 5248 ms (Top 5.11%) | Memory: 68.3 MB (Top 89.11%)
 class Solution:
     def findWinners(self, matches: List[List[int]]) -> List[List[int]]:
         winners, losers, table = [], [], {}
         for winner, loser in matches:
             # map[key] = map.get(key, 0) + change . This format ensures that KEY NOT FOUND error is always prevented.
             # map.get(key, 0) returns map[key] if key exists and 0 if it does not.
-            table[winner] = table.get(winner, 0)  # Winner
+            table[winner] = table.get(winner, 0) # Winner
             table[loser] = table.get(loser, 0) + 1
         for k, v in table.items(): # Player k with losses v
             if v == 0:
                 winners.append(k) # If player k has no loss ie v == 0
             if v == 1:
                 losers.append(k) # If player k has one loss ie v == 1
-        return [sorted(winners), sorted(losers)] # Problem asked to return sorted arrays.
+        return [sorted(winners), sorted(losers)] # Problem asked to return sorted arrays.