We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
给定一个整数数组 nums,其中恰好有两个元素只出现一次,其余所有元素均出现两次。 找出只出现一次的那两个元素。
nums
Input: [1,2,1,3,2,5] Output: [3,5]
[5, 3]
The text was updated successfully, but these errors were encountered:
/** * @param {number[]} nums * @return {number[]} */ var singleNumber = function(nums) { let bitmask = 0; for (let i = 0; i < nums.length; i++) { bitmask ^= nums[i]; } const difference = bitmask & (-bitmask); let r1 = 0; let r2 = 0; for (let i = 0; i < nums.length; i++) { if (difference & nums[i]) { r1 ^= nums[i]; } else { r2 ^= nums[i]; } } return [r1, r2]; };
function singleNumber(nums: number[]): number[] { let bitmask = 0; for (let i = 0; i < nums.length; i++) { bitmask ^= nums[i]; } const difference = bitmask & (-bitmask); let r1 = 0; let r2 = 0; for (let i = 0; i < nums.length; i++) { if (difference & nums[i]) { r1 ^= nums[i]; } else { r2 ^= nums[i]; } } return [r1, r2]; };
Sorry, something went wrong.
No branches or pull requests
260. Single Number III
给定一个整数数组
nums
,其中恰好有两个元素只出现一次,其余所有元素均出现两次。 找出只出现一次的那两个元素。Example
Note
[5, 3]
也是正确答案。The text was updated successfully, but these errors were encountered: