Majority Element II (Sorted Array Variant)

Given a sorted integer array nums of length n, return all elements that appear more than ⌊n / 3⌋ times. Because the array is sorted, identical values are contiguous. There can be at most two such majority elements. You must solve the problem in O(log n) time and O(1) extra space.