GoLang Solution For LeetCode Problem: Find Minimum in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
Find the minimum element.
You may assume no duplicate exists in the array.
Input: [3,4,5,1,2] Output: 1
Input: [4,5,6,7,0,1,2] Output: 0
See the full details of the problem Find Minimum in Rotated Sorted Array at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go