Single Number III
Given an array of numbers nums
, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2, 5]
, return [3, 5]
.
Note:
- The order of the result is not important. So in the above example,
[5, 3]
is also correct. - Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
给出一个数组,在这个数组中,有两个数字出现了两次,其余的数字均只出现了一次
找出这两个数字
思路和Single Number II一样
注意这道题目中用到了js的push()方法,将找到的元素放到数组中