Time: 0 ms (100%), Space: 17.7 MB (84.49%) - LeetHub

wlsgur11 · wlsgur11 · commit d3e6fad88afb · 2025-05-14T11:39:58.000+09:00
diff --git a/1431-kids-with-the-greatest-number-of-candies/1431-kids-with-the-greatest-number-of-candies.py b/1431-kids-with-the-greatest-number-of-candies/1431-kids-with-the-greatest-number-of-candies.py
@@ -1,3 +1,4 @@
 class Solution:
     def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
-        return [max(candies) <= i+extraCandies for i in candies]
+        A = max(candies)
+        return [A <= i+extraCandies for i in candies]
