[LeetCode] Problem 136 - Single Number

Posted on | In ,

Given an array of integers, every element appears twice except for one. Find that single one.

Note

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Example

No.1

Input: [2,2,1]

Output: 1

No.2

Input: [4,1,2,1,2]

Output: 4

Code

1
2
3
4
5
6
7
8
public int singleNumber(int[] nums) {
    int num = 0;

    for (int n : nums)
        num ^= n;

    return num;
}