136题
只能想到哈希表,但空间复杂度不满足,看了官方异或运算的答案真是惊呆了,刷算法比想象中有意思。来自官方题解
class Solution {
public int singleNumber(int[] nums) {
int single = 0;
for (int num : nums) {
single ^= num;
}
return single;
}
}
136题
只能想到哈希表,但空间复杂度不满足,看了官方异或运算的答案真是惊呆了,刷算法比想象中有意思。来自官方题解
class Solution {
public int singleNumber(int[] nums) {
int single = 0;
for (int num : nums) {
single ^= num;
}
return single;
}
}