← 返回 atlassian 的题目列表Single Number III
类型：online_judge
atlassian
Given an integer array nums, in which exactly two elements appear only once and all the other elements appear twice. Find the two elements that appear only once. You can assume that the two elements are different.
Input: nums = [1, 2, 1, 3, 2, 5]
Output: [3, 5]
Example
Input
1 2 1 3 2 5