Single Number III

Medium

Given an array nums in which exactly two elements appear only once and all the others appear exactly twice, return the two single numbers sorted in ascending order. Use O(n) time and O(1) extra space.

Example 1

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

Example 2

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

Constraints

• 2 <= nums.length <= 3*10^4
• Exactly two elements appear once; the rest appear twice.