algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2769 from zhihali/patch-3

Browse Source 
更改 135分发糖果 python实现
This commit is contained in:
程序员Carl
2024-10-23 09:43:16 +08:00
committed by GitHub
parent b2c41f453b 754d2d664d
commit e8f6317e7f
1 changed files with 9 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
problems/0135.分发糖果.md
View File

@ -177,21 +177,20 @@ class Solution {
```python ```python
class Solution: class Solution:
def candy(self, ratings: List[int]) -> int: def candy(self, ratings: List[int]) -> int:
candyVec = [1] * len(ratings) n = len(ratings)
candies = [1] * n
# 从前向后遍历，处理右侧比左侧评分高的情况 # Forward pass: handle cases where right rating is higher than left
for i in range(1, len(ratings)): for i in range(1, n):
if ratings[i] > ratings[i - 1]: if ratings[i] > ratings[i - 1]:
candyVec[i] = candyVec[i - 1] + 1 candies[i] = candies[i - 1] + 1
# 从后向前遍历，处理左侧比右侧评分高的情况 # Backward pass: handle cases where left rating is higher than right
for i in range(len(ratings) - 2, -1, -1): for i in range(n - 2, -1, -1):
if ratings[i] > ratings[i + 1]: if ratings[i] > ratings[i + 1]:
candyVec[i] = max(candyVec[i], candyVec[i + 1] + 1) candies[i] = max(candies[i], candies[i + 1] + 1)
# 统计结果 return sum(candies)
result = sum(candyVec)
return result
``` ```