FilesExpand file tree

 master

/

_260SingleNumberIII.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (29 loc) · 920 Bytes

 master

/

_260SingleNumberIII.java

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (29 loc) · 920 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

/**

* 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?

*/

public class _260SingleNumberIII {

public int[] singleNumber(int[] nums) {

int diff = 0;

for (int num : nums) {

diff ^= num;

}

diff &= -diff;

int[] result = { 0, 0 };

for (int num : nums) {

if ((num & diff) == 0) {

result[0] ^= num;

} else {

result[1] ^= num;

}

}

return result;

}

}