maximum_product_subarray

Author: hitzzc

README.md

@@ -135,6 +135,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [149. Max Points on a Line](https://github.com/hitzzc/go-leetcode/tree/master/max_points_on_a_line)
 #### [150. evaluate reverse polish notation](https://github.com/hitzzc/go-leetcode/tree/master/evaluate_reverse_polish_notation)
 #### [151. reverse words in a string](https://github.com/hitzzc/go-leetcode/tree/master/reverse_words_in_a_string)
+#### [152. maximum product subarray](https://github.com/hitzzc/go-leetcode/tree/master/maximum_product_subarray)
 
 
 

maximum_product_subarray/maximum_product_subarray.go

@@ -0,0 +1,33 @@
+package maximum_product_subarray
+
+func maxProduct(nums []int) int {
+	if len(nums) == 0 {
+		return 0
+	}
+	if len(nums) == 1 {
+		return nums[0]
+	}
+	ret, preMax, preMin := nums[0], nums[0], nums[0]
+	var temp int
+	for i := 1; i < len(nums); i++ {
+		temp = preMax
+		preMax = max(max(nums[i], nums[i]*preMax), nums[i]*preMin)
+		preMin = min(min(nums[i], nums[i]*preMin), nums[i]*temp)
+		ret = max(ret, preMax)
+	}
+	return ret
+}
+
+func max(i, j int) int {
+	if i > j {
+		return i
+	}
+	return j
+}
+
+func min(i, j int) int {
+	if i < j {
+		return i
+	}
+	return j
+}