public class Solution {
public uint reverseBits(uint n) {
var list = new List<uint>();//逆序的二进制列表,list[0]是最低位
while (n != )
{
var cur = n % ;
list.Add(cur);
n = n / ;
}
var addzero = - list.Count;
for (int i = ; i < addzero; i++)//补充到32位
{
list.Add();
} list.Reverse(); uint sum = ;
for (int i = ; i < list.Count; i++)
{
var cur = list[i];
sum += cur * ((uint)(Math.Pow(, i)));
}
return sum;
}
}