关闭

LeetCode Single Number III

标签: leetcode
96人阅读 评论(0) 收藏 举报
分类:

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

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:259022次
    • 积分:7552
    • 等级:
    • 排名:第2834名
    • 原创:510篇
    • 转载:40篇
    • 译文:0篇
    • 评论:30条
    最新评论