LeetCode OJ 153 Find Minimum in Rotated Sorted Array

Posted on   |  

Question

[LeetCode 153] Suppose a sorted array is rotated at some pivot unknown to you beforehand.

Submission

Using binary search, with $O(nLogn)$ running time.

Java Submission
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
public class Solution {
    public int findMin(int[] nums) {
        int lo = 0;
        int hi = nums.length-1;
        
        while (lo < hi) {
            int mid = (lo + hi) / 2;
            if (nums[mid] > nums[hi] && nums[mid] >= nums[lo]) {
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
        return nums[hi];
    }
}