LeetCode 简单操作 | 190. Reverse Bits

/*
 * Leetcode190. Reverse Bits
 * Funtion: Reverse bits of a given 32 bits unsigned integer.
 * Example: given input 43261596 (represented in binary as 00000010100101000001111010011100),
            return 964176192 (represented in binary as 00111001011110000010100101000000).

            Input: 2147483648 (10000000000000000000000000000000)
            Output: 1 (00000000000000000000000000000001)
 * Author: LKJ
 * Date: 2017/2/28
 * Hint: 颠倒bit序列
*/
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t m = 0;
        for(int i = 0; i < 32; i++){
            m = m << 1;
            m = m | (n & 0x01);
            n = n >> 1;
        }
        return m;
    }
};

/*更高效的方法:类似归并排序

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        n = (n >> 16) | (n << 16);
        n = ((n & 0xff00ff00) >> 8) | ((n & 0x00ff00ff) << 8);
        n = ((n & 0xf0f0f0f0) >> 4) | ((n & 0x0f0f0f0f) << 4);
        n = ((n & 0xcccccccc) >> 2) | ((n & 0x33333333) << 2);
        n = ((n & 0xaaaaaaaa) >> 1) | ((n & 0x55555555) << 1);
        return n;
    }
};


*/


int main(){
    //int myarr[7] = {9, 9, 9, 9, 9, 9, 9};
    //vector<int> myin(myarr,myarr+7);
    uint32_t myin =43261596;
    uint32_t myout;
    Solution SA;

    //cout << "Please Enter" << endl;
    //cin >> myin >> myin1;
    myout = SA.reverseBits(myin);
    cout << myout << endl;

//    cout<<"VecOUT:"<<myout.size()<<endl;
//    for(unsigned int i = 0; i < myout.size(); i++){
//        for(vector<int>::iterator itt = myout[i].begin() ;itt!=myout[i].end(); itt++){
//            cout<<*itt<<"     ";
//        }
//        cout<<endl;
//    }
//    cout<<endl;

//    cout<<"VecOUT:"<<endl;
//    for(vector<int>::iterator it = myout.begin() ;it!=myout.end();it++){
//        cout<<*it<<"     ";
//    }
//    cout<<endl;

    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值