public class Solution {
public int singleNumber(int[] A) {
int res = A[0];
if (A.length==1) return res;
for (int i=1; i<A.length; i++) {
res = res ^ A[i]; //XOR
}
return res;
}
}
1. O(n) time --> no sort
回复删除2. O(1) space --> no hash map
So, XOR.