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-))) && (n>))
            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 = ;
        while(n != )
        {
            if(n%)
            {count++;}
            n = n>>;
        }
        return count;
    }
};

//网上大神的解法
int CountOne(unsigned long n)
{
    //0xAAAAAAAA，0x55555555分别是以“1位”为单位提取奇偶位
    n = ((n & 0xAAAAAAAA) >> ) + (n & 0x55555555);
    //0xCCCCCCCC，0x33333333分别是以“2位”为单位提取奇偶位
    n = ((n & 0xCCCCCCCC) >> ) + (n & 0x33333333);
    //0xF0F0F0F0，0x0F0F0F0F分别是以“4位”为单位提取奇偶位
    n = ((n & 0xF0F0F0F0) >> ) + (n & 0x0F0F0F0F);
    //0xFF00FF00，0x00FF00FF分别是以“8位”为单位提取奇偶位
    n = ((n & 0xFF00FF00) >> ) + (n & 0x00FF00FF);
    //0xFFFF0000，0x0000FFFF分别是以“16位”为单位提取奇偶位
    n = ((n & 0xFFFF0000) >> ) + (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).

 //我的解法
 class Solution {
 public:
     uint32_t reverseBits(uint32_t n) {
         uint32_t temp[];
         uint32_t n1 = ;
         for(int i = ;i<;i++)
         {
             temp[i] = n % ;
             n = n >> ;
         }
         for(int i = ;i<;i++)
         {
             n1 += (temp[i]<<(-i));
         }
         return n1;
     }
 };

 //网上大神的写法
 class Solution {
 public:
     uint32_t reverseBits(uint32_t n) {
         uint32_t value = ;
         uint32_t mask = ;
         for (uint32_t i = ; i < ; ++i) {
             value = (value<< )|((n&mask)>>i);
             mask <<=;
         }
         return value;
     }
 };

参考：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.

 class Solution {
 public:
     int singleNumber(vector<int>& nums) {
         int result = ;
         for(int i = ;i < nums.size();i++)
         {
             result = result ^ nums[i];
         }
         return result;
     }
 };

137. Single Number two

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

 class Solution {
 public:
     int singleNumber(vector<int>& nums) {
         vector<int> flag();
         int result = ;
         for(int k = ;k < ;k++)
         {
             for(int i = ;i < nums.size();i++)
             {
                 flag[k] += ((nums[i]>>k) & );
             }
         }
         for(int k = ;k < ;k++)
         {
             result += ((flag[k] % )<<k);
         }
         return result;
     }
 };

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

 class Solution {
 public:
     vector<int> singleNumber(vector<int>& nums) {
         vector<int> result();
         int temp = ;
         for(int i = ;i < nums.size();i++)
         {
             temp ^= nums[i];
         }
         int flag = ;
         while(!(temp & ))
         {
             temp >>= ;
             flag++;
         }
         for(int i = ;i < nums.size();i++)
         {
             int tmp = nums[i]>>flag;
             if(tmp & )
                 result[] ^= nums[i];
             else
                 result[] ^= nums[i];
         }
         return result;
     }
 };