题目一:
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
题目二:
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
解答:
第一题是要从N个元素的整型数组中找出只出现一次的“单身”元素,其它的都是“成双成对”。如果不考虑额外空间的话,这题最直接的思路是用一个哈希表去映射元素和次数,然后找出次数为1的那个。但题目要求尽可能不开辟额外内存,而且用整数的值取做哈希表的key,哈希表可能会很大。因此,不可取。
于是,想到位运算里的异或运算(同0异1),即把数组的元素全部做异或运算,最终出现两次的元素都会变成0,和“单身”元素进行一次异或,结果就是“单身”元素本身。AC代码如下:
class Solution {
public:
int singleNumber(int A[], int n) {
int result = 0;
for (int i = 0; i < n; i++)
result ^= A[i];
return result;
}
};
public int singleNumber(int[] A) {
int ones = 0, twos = 0;
for(int i = 0; i < A.length; i++){
ones = (ones ^ A[i]) & ~twos;
twos = (twos ^ A[i]) & ~ones;
}
return ones;
}
后来,找到一个相对好理解的思路:把数组中所有的元素看成是32位(一般机器int是32位)的二进制表示,那么重复出现三次的元素中每一位“1”也就重复出现三次。如果把所有元素32位中的每一位分别累加,然后再对3取模,那么得到的余数就是“单身”元素的那一位二进制表示。最后再把得到的32位通过移位操作转换成十进制,就得到了“单身”元素的值。虽然需要开辟一个保存32个元素的数组存放每一位的和,但开销相对较小,可以接受。AC代码如下:
int singleNumber(int A[], int n) {
int i, j, result = 0;
int bits[32];//store the sum of all 32 bits in A[]
for(i=0; i<32; i++)
{
bits[i] = 0;
for(j=0; j<n; j++)
{
bits[i] += (A[j]>>i)&1;//sum each element's ith bit
}
}
for(i=0; i<32; i++)
{
result += (bits[i]%3)<<i;//restore the single number's 32 bits
}
return result;
}
感谢这篇博文的答疑解惑! Code_Ganker的Single Number II -- LeetCode