Runtime: 210 ms (Top 78.26%) | Memory: 16.7 MB (Top 74.66%)

Author: AnasImloul

scripts/algorithms/C/Candy/Candy.py

@@ -1,19 +1,18 @@
+// Runtime: 210 ms (Top 78.26%) | Memory: 16.7 MB (Top 74.66%)
 class Solution:
     def candy(self, ratings: List[int]) -> int:
         n=len(ratings)
         temp = [1]*n
-        
+
         for i in range(1,n):
             if(ratings[i]>ratings[i-1]):
                 temp[i]=temp[i-1]+1
         if(n>1):
             if(ratings[0]>ratings[1]):
                 temp[0]=2
-                
-            
+
         for i in range(n-2,-1,-1):
             if(ratings[i]>ratings[i+1] and temp[i]<=temp[i+1]):
                 temp[i]=temp[i+1]+1
 
-                
-        return sum(temp)
+        return sum(temp)