剑指 Offer 56 - I. 数组中数字出现的次数
一个整型数组 nums 里除两个数字之外,其他数字都出现了两次。请写程序找出这两个只出现一次的数字。要求时间复杂度是O(n),空间复杂度是O(1)。
示例 1:
输入:nums = [4,1,4,6]
输出:[1,6] 或 [6,1]
示例 2:
输入:nums = [1,2,10,4,1,4,3,3]
输出:[2,10] 或 [10,2]
限制:
2 <= nums.length <= 10000
class Solution {
public int[] singleNumbers(int[] nums) {
int judg = 0;
for(int i = 0; i < nums.length; ++i) {
judg ^= nums[i];
}
int res1 = 0, res2 = 0, judgIndex = getHighPos(judg);
// System.out.println(judg + " " + judgIndex);
for(int i = 0; i < nums.length; ++i) {
if(getHighPos(nums[i], judgIndex)) {
res1 ^= nums[i];
} else {
res2 ^= nums[i];
}
}
return new int[]{res1, res2};
}
int getHighPos(int n) {
int pos = 0;
while(n > 0) {
n >>= 1;
pos++;
// System.out.println(n + " " + pos);
}
// System.out.println(n + " " + pos);
return pos;
}
boolean getHighPos(int n, int index) {
int pos = 0;
while(n > 0) {
pos++;
if(pos == index) {
if(n % 2 == 1) {
return true;
}
}
n >>= 1;
// System.out.println(n + " " + pos);
}
return false;
// System.out.println(n + " " + pos);
}
// 优化
// public int[] singleNumbers(int[] nums) {
// int judg = 0;
// for(int i = 0; i < nums.length; ++i) {
// judg ^= nums[i];
// }
// int judg_tmp = 1;
// while((judg_tmp & judg) == 0) {
// judg_tmp <<= 1;
// }
// int res1 = 0, res2 = 0;
// // System.out.println(judg + " " + judgIndex);
// for(int i = 0; i < nums.length; ++i) {
// if((judg_tmp & nums[i]) != 0) {
// res1 ^= nums[i];
// } else {
// res2 ^= nums[i];
// }
// }
// return new int[]{res1, res2};
// }
}