题目描述
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
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?
经典题目
class Solution {
public:
int singleNumber(int A[], int n) {
int pn = 0;
for(int i = 0;i < n;i ++)
pn = pn^A[i];
return pn;
}
};