/*
* 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;
}
LeetCode 简单操作 | 190. Reverse Bits
最新推荐文章于 2023-11-19 19:00:00 发布