Given an array of integers, where every element appears twice except for one, find the element that occurs only once.
Note: The solution must have linear runtime and constant space complexity.
Constraints:
nums.length