-
- //查表法一波带走进制转化
- public static void trans(int num,int base,int position) {
- if (num ==0) {//若数为0,则不用判断
- System.out.println(0);
- return;
- }
- char[] table={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'};//表
- char[] arr = new char[32];//定义一个数组容器存放
-
- position = arr.length;//数组指针,反向存放数据
- while (num!=0) {
- int temp = 0;
- temp = num%base;
- num = num>>>position;
- }
- for (int i = position; i < arr.length; i++) {
- System.out.print(arr[i]);
- }
- }
- public static void toBin(int num) {
- trans(num, 2, 1);
- }
- public static void toHex(int num) {
- trans(num ,15,4);
- }
复制代码
|
|