find_peak_element

Author: hitzzc

README.md

@@ -140,6 +140,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [154. find minimum in rotated sorted array II](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array_II)
 #### [155. Min Stack](https://github.com/hitzzc/go-leetcode/tree/master/min_stack)
 #### [160. Intersection of Two Linked Lists](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_linked_lists)
+#### [162. Find Peak Element](https://github.com/hitzzc/go-leetcode/tree/master/find_peak_element)
 
 
 

find_peak_element/find_peak_element.go

@@ -0,0 +1,17 @@
+package find_peak_element
+
+func findPeakElement(nums []int) int {
+	left, right := 0, len(nums)-1
+	for left <= right {
+		if left == right {
+			return left
+		}
+		mid := left + (right-left)/2
+		if nums[mid] < nums[mid+1] {
+			left = mid + 1
+		} else {
+			right = mid
+		}
+	}
+	return -1
+}