以11为例子,//11:0000 0000 0000 0000 0000 0000 0000 1011
奇数位序列:0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
偶数位序列:0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
我之前写过一篇文章与这题一样:https://blog.csdn.net/question_mark/article/details/99644495
方法一:数组存储偶数位以及计数位
public class PrintNum {
public static void main(String[] args) {
int value=11;
int[] arr1={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int[] arr2={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int j=0;
for(int i=0;i<32;i+=2){
arr1[j]=(value>>i)&1;
j++;
}
j=0;
for(int i=1;i<32;i+=2){
arr2[j]=(value>>i)&1;
j++;
}
for(int i=15;i>=0;i--){
System.out.print(arr1[i]);
}
System.out.println("");
for(int i=15;i>