candy

Author: hitzzc

README.md

@@ -118,6 +118,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [132. palindrome partitioning II](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_partitioning_II)
 #### [133. Clone Graph](https://github.com/hitzzc/go-leetcode/tree/master/clone_graph)
 #### [134. gas station](https://github.com/hitzzc/go-leetcode/tree/master/gas_station)
+#### [135. candy](https://github.com/hitzzc/go-leetcode/tree/master/candy)
 
 
 

candy/candy.go

@@ -0,0 +1,31 @@
+package candy
+
+func candy(ratings []int) int {
+	if len(ratings) == 0 {
+		return 0
+	}
+	reduceLength, growLength := 0, 1
+
+	pre := 1
+	ret := 1
+	for i := 1; i < len(ratings); i++ {
+		if ratings[i] < ratings[i-1] {
+			reduceLength++
+			if reduceLength >= pre {
+				ret++
+			}
+			ret += reduceLength
+			growLength = 1
+		} else {
+			cur := 1
+			if ratings[i] > ratings[i-1] {
+				cur = growLength + 1
+			}
+			growLength = cur
+			ret += cur
+			reduceLength = 0
+			pre = cur
+		}
+	}
+	return ret
+}