Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 135 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 135 # by problem number
lcpy gen -s candy # by problem name
n children standing in a line. Each child is assigned a rating value given in the integer array ratings.
You are giving candies to these children subjected to the following requirements:
Input: ratings = [1,0,2]
Output: 5
Input: ratings = [1,2,2]
Output: 4
class Solution:
# Time: O(n)
# Space: O(n)
def candy(self, ratings: list[int]) -> int:
n = len(ratings)
candies = [1] * n
# Left-to-right: satisfy higher-than-left-neighbor constraint
for i in range(1, n):
if ratings[i] > ratings[i - 1]:
candies[i] = candies[i - 1] + 1
# Right-to-left: satisfy higher-than-right-neighbor constraint
for i in range(n - 2, -1, -1):
if ratings[i] > ratings[i + 1]:
candies[i] = max(candies[i], candies[i + 1] + 1)
return sum(candies)
| Time | Space |
|---|---|
| O(n) | O(n) |