Time: 531 ms (61.41%), Space: 29.5 MB (94.02%) - LeetHub

1657-find-the-winner-of-an-array-game/1657-find-the-winner-of-an-array-game.py

@@ -0,0 +1,21 @@
+class Solution:
+    def getWinner(self, arr: List[int], k: int) -> int:
+        if k == 1:
+            return max(arr[0], arr[1])
+        if k >= len(arr):
+            return max(arr)
+
+        current_winner = arr[0]
+        consecutive_wins = 0
+
+        for i in range(1, len(arr)):
+            if current_winner > arr[i]:
+                consecutive_wins += 1
+            else:
+                current_winner = arr[i]
+                consecutive_wins = 1
+
+            if consecutive_wins == k:
+                return current_winner
+
+        return current_winner