class Solution {
public:
int singleNumber(int A[], int n) {
int res=0;
for(int i=0;i<n;++i){
res^=A[i];
}
return res;
}
};
[leetcode] Single Number
最新推荐文章于 2021-11-09 16:03:31 发布
class Solution {
public:
int singleNumber(int A[], int n) {
int res=0;
for(int i=0;i<n;++i){
res^=A[i];
}
return res;
}
};