leetcode--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).

Follow up:
If this function is called many times, how would you optimize it?

Related problem: Reverse Integer

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
		for(int i=0;i<16;i++){
			n = swap(n, i, 31-i);
		}
		return n;
    }
	
	/**
	 * 交换imj位
	 * @param n
	 * @param i
	 * @param j
	 * @return
	 */
	int swap(int n,int i,int j){
		int t = (n>>i)&1;//获取第i位		
		n = n&(~(1<<i));//将第i位置0		
		int t2 = (n>>j)&1;//获取第j为
		n = n&(~(1<<j));//将第j位置0		
		n = n|(t<<j);//将第j位设置为原i位上的数		
		n = n|(t2<<i);//将第i位设置为原j位上的数
		return n;
	}
}