時間限制：1秒 空間限制：32768K
題目描述
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 ones=0;
for(int i=0;i<n;i++){
int cur=A[i];
ones^=cur;
}
return ones;
}
};
運行時間：7ms
占用內存：476k
