LeetCode Solutions
136. Single Number
Time: $O(n)$ Space: $O(1)$
class Solution {
public:
int singleNumber(vector<int>& nums) {
int ans = 0;
for (const int num : nums)
ans ^= num;
return ans;
}
};
class Solution {
public int singleNumber(int[] nums) {
int ans = 0;
for (final int num : nums)
ans ^= num;
return ans;
}
}
class Solution:
def singleNumber(self, nums: List[int]) -> int:
return functools.reduce(lambda x, y: x ^ y, nums, 0)