Single Number

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

You must implement a solution with O(n) time complexity and O(1) extra space.

Examples

Example 1:

Input: nums = [2,2,1]
Output: 1

Example 2:

Input: nums = [4,1,2,1,2]
Output: 4

Constraints

• 1 <= nums.length <= 3 * 10^4
• -3 * 10^4 <= nums[i] <= 3 * 10^4