LeetCode Single Number III
来源:互联网 发布:淘宝店铺怎么重新开 编辑:程序博客网 时间:2024/06/01 09:06
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].
Note:
The order of the result is not important. So in the above example, [5, 3] is also correct.
Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
func singleNumber(nums []int) []int { diff := 0 for _, num := range nums { diff = diff ^ num } diff = -diff & diff result := make([]int, 2) for _, num := range nums { if diff & num == 0 { result[0] = result[0] ^ num } else { result[1] = result[1] ^ num } } return result}
0 0
- [LeetCode] Single Number III
- [leetcode] Single Number III
- [Leetcode]Single Number III
- [leetcode] Single Number III
- Leetcode: Single Number III
- LeetCode || Single Number III
- leetCode---Single Number III
- *LeetCode-Single Number III
- Single Number III -- leetcode
- Leetcode: Single Number III
- [LeetCode] Single Number III
- LeetCode--Single Number III
- leetcode-Single Number III
- LeetCode:Single Number III
- [LeetCode] Single Number III
- LeetCode -- Single Number III
- 【leetcode】Single Number III
- 【Leetcode】Single Number III
- YUV格式详解(综合其他资料)
- java标识符定义及其规则规范
- android 开发问题
- 急切求助
- 问几个关于在Nokia上的jsr82蓝牙的问题,希望接触过的朋友指点一下.
- LeetCode Single Number III
- 休息一下,聊聊前阵看的动漫《心理测量者》
- Form中下载文件
- J2ME的skip的使用问题。
- 服务器上注册封装asp的dll权限问题
- 关于 OfferKeyEventL()函数 请帮忙!
- 动态tiles的意思
- 运算符整理
- 我的程序人生—新的开始。