LC-0154 Hard LeetCode

154. Find Minimum in Rotated Sorted Array II

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 44% Topics: Array, Binary Search

Reading material

Arrays & Hashing 12 min Binary Search 12 min

Reference solution (spoiler · python)

# Time:  O(logn) ~ O(n)
# Space: O(1)

class Solution(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        left, right = 0, len(nums) - 1
        while left < right:
            mid = left + (right - left) / 2

            if nums[mid] == nums[right]:
                right -= 1
            elif nums[mid] < nums[right]:
                right = mid
            else:
                left = mid + 1

        return nums[left]


class Solution2(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        left, right = 0, len(nums) - 1
        while left < right and nums[left] >= nums[right]:
            mid = left + (right - left) / 2

            if nums[mid] == nums[left]:
                left += 1
            elif nums[mid] < nums[left]:
                right = mid
            else:
                left = mid + 1

        return nums[left]

Solution from kamyu104/LeetCode-Solutions · MIT