Single Number

Single Number

  Total Accepted: 28603  Total Submissions: 62862 My Submissions

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?

Have you been asked this question in an interview?  Yes

Discuss

这个把所有数字异或一遍，就得到结果了。

public class Solution {
    public int singleNumber(int[] A) {
         int res = A[0];
        for(int i=1;i<A.length;i++)
        {
            res = res^A[i];
        }
        return res;
    }
}