Single Number II
MediumP3Coding
Every element of nums appears exactly three times except for one element, which appears exactly once. Return that single element.
Aim for linear time and constant extra space.
Example 1
- Input
- nums = [2,2,3,2]
- Output
- 3
Example 2
- Input
- nums = [0,1,0,1,0,1,99]
- Output
- 99
Example 3
- Input
- nums = [5]
- Output
- 5
Constraints
- 1 <= nums.length <= 3 * 10^4
- -2^31 <= nums[i] <= 2^31 - 1
- Exactly one element appears once; all others appear three times.
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.