lizc_lizc的博客

public class BitMap { private int[] values; public BitMap() { this.values = new int[1]; } public void setBit(int n, boolean value) { int index = n / Integer.SIZE; int offset = n % Integer.SIZE; if (index &gt

异或运算的性质 1）0^N == N, N^N == 0 2）异或运算满足交换律和结合率 3）不用额外变量交换两个数 4) 异或就是无进位的相加 int a = A, b = B; a = a ^ b = A ^ B; b = a ^ b = (A ^ B) ^ B = A ^ (B ^ B) = A ^ 0 = A； a = a ^ b = (A ^ B) ^ A = (A ^ A) * B = B; 4）一个数组中有一种数出现了奇数次，其他数都出现了偶数次，怎么找到这一个数 public class