Single Number
EasyP2Coding
Every element of nums appears twice except one element, which appears once. Return the element that appears once.
Use linear time and constant extra space.
Example 1
- Input
- nums = [2,2,1]
- Output
- 1
Example 2
- Input
- nums = [4,1,2,1,2]
- Output
- 4
Example 3
- Input
- nums = [1]
- Output
- 1
Constraints
- 1 <= nums.length <= 3 * 10^4
- -3 * 10^4 <= nums[i] <= 3 * 10^4
- Exactly one element appears once; all others appear twice.
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.