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
最新推荐文章于 2024-10-05 12:29:44 发布
class Solution {
public:
int singleNumber(int A[], int n) {
int res = 0;
for( int i = 0; i < n; ++i)
res ^= A[i];
return res;
}
};