Update 0135.分发糖果.md

problems/0135.分发糖果.md

@@ -178,13 +178,21 @@ class Solution {
 class Solution:
     def candy(self, ratings: List[int]) -> int:
         candyVec = [1] * len(ratings)
+        
+        # 从前向后遍历，处理右侧比左侧评分高的情况
         for i in range(1, len(ratings)):
             if ratings[i] > ratings[i - 1]:
                 candyVec[i] = candyVec[i - 1] + 1
-        for j in range(len(ratings) - 2, -1, -1):
-            if ratings[j] > ratings[j + 1]:
-                candyVec[j] = max(candyVec[j], candyVec[j + 1] + 1)
-        return sum(candyVec)
+        
+        # 从后向前遍历，处理左侧比右侧评分高的情况
+        for i in range(len(ratings) - 2, -1, -1):
+            if ratings[i] > ratings[i + 1]:
+                candyVec[i] = max(candyVec[i], candyVec[i + 1] + 1)
+        
+        # 统计结果
+        result = sum(candyVec)
+        return result
+
 ```
 
 ### Go