Single Element in a Sorted Array
MediumP2Coding
nums is sorted in ascending order. Every element appears exactly twice except for one element that appears once. Return that single element.
Your solution must run in O(log n) time and O(1) space.
Example 1
- Input
- nums = [1,1,2,3,3,4,4,8,8]
- Output
- 2
Example 2
- Input
- nums = [3,3,7,7,10,11,11]
- Output
- 10
Example 3
- Input
- nums = [5]
- Output
- 5
Constraints
- 1 <= nums.length <= 10^5 and nums.length is odd
- 0 <= nums[i] <= 10^5
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 10. ⌘Enter runs, ⌘⇧Enter submits.