zoukankan      html  css  js  c++  java
  • LeetCode_Bit Manipulation

    231. Power of Two

       Given an integer, write a function to determine if it is a power of two.

       

    class Solution {
    public:
        bool isPowerOfTwo(int n) {
            if((!(n&(n-1))) && (n>0)) 
                return true;
            else
                return false;
        }
    };

    191. Number of 1 Bits

        Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).

       For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.

    //我的解法
    class Solution {
    public:
        int hammingWeight(uint32_t n) {
            int count = 0;
            while(n != 0)
            {
                if(n%2)
                {count++;}
                n = n>>1;
            }
            return count;
        }
    };
    //网上大神的解法
    int CountOne(unsigned long n)
    {
        //0xAAAAAAAA,0x55555555分别是以“1位”为单位提取奇偶位
        n = ((n & 0xAAAAAAAA) >> 1) + (n & 0x55555555);
        //0xCCCCCCCC,0x33333333分别是以“2位”为单位提取奇偶位
        n = ((n & 0xCCCCCCCC) >> 2) + (n & 0x33333333);
        //0xF0F0F0F0,0x0F0F0F0F分别是以“4位”为单位提取奇偶位
        n = ((n & 0xF0F0F0F0) >> 4) + (n & 0x0F0F0F0F);
        //0xFF00FF00,0x00FF00FF分别是以“8位”为单位提取奇偶位
        n = ((n & 0xFF00FF00) >> 8) + (n & 0x00FF00FF);
        //0xFFFF0000,0x0000FFFF分别是以“16位”为单位提取奇偶位
        n = ((n & 0xFFFF0000) >> 16) + (n & 0x0000FFFF);
    
        return n;
    }

    参考: http://blog.csdn.net/yunyu5120/article/details/6692072

    190. Reverse Bits

       Reverse bits of a given 32 bits unsigned integer.

       For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary        as  00111001011110000010100101000000).

      

     1 //我的解法
     2 class Solution {
     3 public:
     4     uint32_t reverseBits(uint32_t n) {
     5         uint32_t temp[32];
     6         uint32_t n1 = 0;
     7         for(int i = 0;i<32;i++)
     8         {
     9             temp[i] = n % 2;
    10             n = n >> 1;
    11         }
    12         for(int i = 0;i<32;i++)
    13         {
    14             n1 += (temp[i]<<(31-i));
    15         }
    16         return n1;
    17     }
    18 };
     1 //网上大神的写法
     2 class Solution {
     3 public:
     4     uint32_t reverseBits(uint32_t n) {
     5         uint32_t value = 0;
     6         uint32_t mask = 1;
     7         for (uint32_t i = 0; i < 32; ++i) {
     8             value = (value<<1 )|((n&mask)>>i);
     9             mask <<=1;
    10         }
    11         return value;
    12     }
    13 };

    参考:http://blog.csdn.net/feliciafay/article/details/44536827

    136. Single Number

    Given an array of integers, every element appears twice except for one. Find that single one.

     1 class Solution {
     2 public:
     3     int singleNumber(vector<int>& nums) {
     4         int result = 0;
     5         for(int i = 0;i < nums.size();i++)
     6         {
     7             result = result ^ nums[i];
     8         }
     9         return result;
    10     }
    11 };

    137. Single Number two

    Given an array of integers, every element appears three times except for one. Find that single one.

     1 class Solution {
     2 public:
     3     int singleNumber(vector<int>& nums) {
     4         vector<int> flag(32);
     5         int result = 0;
     6         for(int k = 0;k < 32;k++)
     7         {
     8             for(int i = 0;i < nums.size();i++)
     9             {
    10                 flag[k] += ((nums[i]>>k) & 1);
    11             }
    12         }
    13         for(int k = 0;k < 32;k++)
    14         {
    15             result += ((flag[k] % 3)<<k);
    16         }
    17         return result;
    18     }
    19 };

    260. Single Number three

    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].

     1 class Solution {
     2 public:
     3     vector<int> singleNumber(vector<int>& nums) {
     4         vector<int> result(2);
     5         int temp = 0;
     6         for(int i = 0;i < nums.size();i++)
     7         {
     8             temp ^= nums[i];            
     9         }
    10         int flag = 0;
    11         while(!(temp & 1))
    12         {
    13             temp >>= 1;
    14             flag++;
    15         }
    16         for(int i = 0;i < nums.size();i++)
    17         {
    18             int tmp = nums[i]>>flag;
    19             if(tmp & 1)
    20                 result[0] ^= nums[i];
    21             else
    22                 result[1] ^= nums[i];
    23         }
    24         return result;
    25     }
    26 };
  • 相关阅读:
    nginx相关参考博客
    MySQL workbench8.0 CE基本用法(创建数据库、创建表、创建用户、设置用户权限、创建SQL语句脚本)
    MySQL Workbench基本操作
    idea导入(import)项目和打开(open)项目的区别
    [铁道部信息化管理]需求分析(一)—— 售票系统领域知识(区间票、订票、预留票)
    [铁道部信息化管理]核心业务需求及逻辑架构分析
    【spring boot 系列】spring data jpa 全面解析(实践 + 源码分析)
    OOAD-设计模式(一)概述
    TKmybatis的框架介绍和原理分析及Mybatis新特性
    国内程序员的十大疑问之一:为什么老外不愿意用MyBatis?
  • 原文地址:https://www.cnblogs.com/niuxichuan/p/5313305.html
Copyright © 2011-2022 走看看