[LeetCode]190. Reverse Bits

https://leetcode.com/problems/reverse-bits/description/

题目描述: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).
分析：将32位无符号整数的二进制表示逆序（位操作）

解题思路:将n的最低位与1相与后右移，并将相与后的结果左移31-i个位置，完成二进制的逆序操作。

public int reverseBits(int n) {
         int result = 0;
         for(int i=0;i<32;i++){
             result|=(n>>i&1)<<(31-i);
         }
         return result;
     }