[Leetcode] Single Number 1 & 2
class Solution {public: int singleNumber(int A[], int n) { if (n == 0) return 0; int x = A[0]; for (int i = 1; i < n; i++) x^=A[i]; return x; }};
?
?
class Solution {public: int singleNumber(int A[], int n) { int x[32]; memset(x, 0, sizeof(x)); for (int i = 0; i < n; i++) { for (int j = 0; j < 32; j++) { x[j] += (A[i] >> j) & (1); x[j] %= 3; } } int res = 0; for (int i = 0; i < 32; i++) { res += (x[i] << i); } return res; }};?
?
