From 754d2d664d848a7f79b7b97347f9fcf27a03749b Mon Sep 17 00:00:00 2001
From: Zhihan Li <54661071+zhihali@users.noreply.github.com>
Date: Sun, 29 Sep 2024 23:24:11 +0100
Subject: [PATCH] =?UTF-8?q?Update=200135.=E5=88=86=E5=8F=91=E7=B3=96?=
 =?UTF-8?q?=E6=9E=9C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0135.分发糖果.md | 19 +++++++++----------
 1 file changed, 9 insertions(+), 10 deletions(-)

diff --git a/problems/0135.分发糖果.md b/problems/0135.分发糖果.md
index 6805857e..29eaa06d 100644
--- a/problems/0135.分发糖果.md
+++ b/problems/0135.分发糖果.md
@@ -177,21 +177,20 @@ class Solution {
 ```python
 class Solution:
     def candy(self, ratings: List[int]) -> int:
-        candyVec = [1] * len(ratings)
+        n = len(ratings)
+        candies = [1] * n
         
-        # 从前向后遍历，处理右侧比左侧评分高的情况
-        for i in range(1, len(ratings)):
+        # Forward pass: handle cases where right rating is higher than left
+        for i in range(1, n):
             if ratings[i] > ratings[i - 1]:
-                candyVec[i] = candyVec[i - 1] + 1
+                candies[i] = candies[i - 1] + 1
         
-        # 从后向前遍历，处理左侧比右侧评分高的情况
-        for i in range(len(ratings) - 2, -1, -1):
+        # Backward pass: handle cases where left rating is higher than right
+        for i in range(n - 2, -1, -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)
         
-        # 统计结果
-        result = sum(candyVec)
-        return result
+        return sum(candies)
 
 ```