1.LeetCode 89题 Gray Code
public List<Integer> grayCode2(int n) {
List<Integer> result = new LinkedList<>();
for (int i = 0; i < 1 << n; i++){
result.add(i ^ i >> 1);
}
return result;
}
2.LeetCode 136题 Single Number
public int singleNumber(int[] nums) {
int result = 0;
if(nums.length ==1){
return nums[0];
}else{
for(int i = 0; i < nums.length; i++){
result ^= nums[i];
}
}
return result;
}
