zoukankan      html  css  js  c++  java
  • Single Number III leetcode java

    问题描述:

    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:

    1. The order of the result is not important. So in the above example, [5, 3] is also correct.
    2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

    提示:bit manipulation

    一、位运算

    //参照single number 的方法,将所有数异或运算,得到result为两个single number的异或;
    //找到result中最低位为1的那一位,是两个single number不同的地方,根据这个bit,可以将nums数组中的数分为A、B两组;
    //然后分别在A和B中寻找single number即可

    public static int[] singleNumber_Bit(int[] nums){
    
        int result = 0;
        for(int i = 0; i < nums.length; i++){
            result = result ^ nums[i];
        }
        int[] res = new int[2];
        //找到result二进制表示中最右侧的1
        int pos = result & ( ~ (result - 1 )); //统计一个int型整数的二进制表示中有多少个1,可以采用 n = n & (n - 1);来从右到左逐个统计1的个数
        for(int i = 0 ; i < nums.length; i++){ //将nums分为A B两组来分别求single number
             if((pos & nums[i]) != 0){
                    res[0] = res[0] ^ nums[i];
             } else {
                    res[1] = res[1] ^ nums[i];
             }
        }
        return res;
    }
  • 相关阅读:
    经典线程同步总结 关键段 事件 互斥量 信号量
    寄存器与缓存的区别
    自动变量
    进程的阻塞和挂起的区别
    经典线程同步 信号量Semaphore
    热门智力题 过桥问题和倒水问题
    经典线程同步 互斥量Mutex
    解决面试题的思路
    java.util.LinkedHashMap cannot be cast to
    E11000 duplicate key error index
  • 原文地址:https://www.cnblogs.com/mydesky2012/p/5032735.html
Copyright © 2011-2022 走看看