本文链接:java 2-10进制的随意转换_712f的博客-CSDN博客 后续
不是真正的任意,只要不是特别特别大,都能立马完成转换
运算里面的方法可以改成
T1 -------------拉跨的一批
T2 -------------还是拉(只要给足够的时间,能转换出来的qwq)
T3 -------------速度yyds !!!
注:
1=1;
10=A;
36=a;
import java.util.Scanner;
public class Qjz {
public static void main(String[] args) {
/*
输入
*/
Scanner scanner = new Scanner(System.in);
System.out.println("请输入输入数的进制");
int top = scanner.nextInt();
System.out.println("请输入输出数的进制");
int bottom = scanner.nextInt();
System.out.println("请输入你转换的数");
String s = scanner.next();
// by[长度]
int[] by = new int[s.length()];
/*
赋值1
*/
// 先全部为0
for (int i = 0; i < s.length(); i++) {
by[i] = 0;
}
// 当发现有的时候by[top][长度]
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) <= '9' && s.charAt(i)>='0') { by[i] = s.charAt(i)-'0'; }
else if (s.charAt(i) <= ('Z' - (36 - top)) && s.charAt(i)>='A') { by[i] = 10 + s.charAt(i)-'A'; }
else if (s.charAt(i) <= ('z' - (36 - top)) && s.charAt(i)>='a') { by[i] = 36 + s.charAt(i) - 'a'; }
else {
System.out.println("输入错误");
return;
}
}
/*
赋值2
*/
// 判断查看需不需要扩充数组
int le = s.length();
if (top > bottom){
le = (top/bottom)*s.length();
}
int[] bs = new int[le];
// 先全部为false
for (int i = 0; i < by.length; i++) {
bs[i] = 0;
}
/*
运算
*/
T3(top,by,bottom,bs,le);
/*
输出
*/
for (int i = 0; i < le; i++) {
// 删除前置0
if (bs[i] == 0) continue;
for (; i < le; i++) {
if (bs[i]<10) System.out.print(bs[i]);
else if (bs[i]<36) System.out.print((char)(bs[i]-10+'A'));
else System.out.print(bs[i]-36+'a');
}
}
}
/*
运算1
*/
public static void T1 (int top,int[] by,int bottom,int[] bs,int le){
while (true) {
// 判断
boolean flag = true;
for (int i = 0; i < by.length; i++) {
if (by[i] != 0) flag = false;
}
if (flag) break;
// 减一
int i = 0;
by[by.length - i - 1]--;
for (; i < by.length - 1; i++) {
if (by[by.length - i - 1] == -1) {
by[by.length - i - 1] = top - 1;
by[by.length - i - 2]--;
} else {
break;
}
}
// 加一
i = 0;
bs[le - i - 1]++;
for (; i < le - 1; i++) {
if (bs[le - i - 1] == bottom) {
bs[le - i - 1] = 0;
bs[le - i - 2]++;
} else {
break;
}
}
}
}
/*
运算2
*/
public static void T2(int top,int[] by,int bottom,int[] bs,int le){
int f = 0;
while (f < by.length - 1) {
// 优化判断1
if (by[f] == 0){
f++;
}
// 减一
int i = 0;
by[by.length - i - 1]--;
for (; i < by.length - 1; i++) {
if (by[by.length - i - 1] == -1) {
by[by.length - i - 1] = top - 1;
by[by.length - i - 2]--;
} else {
break;
}
}
// 加一
i = 0;
bs[le - i - 1]++;
for (; i < le - 1; i++) {
if (bs[le - i - 1] == bottom) {
bs[le - i - 1] = 0;
bs[le - i - 2]++;
} else {
break;
}
}
}
}
/*
运算3
*/
public static void T3(int top,int[] by,int bottom,int[] bs,int le){
// 从前往后,进制转换
// 循环从前往后
for (int i = 0; i < by.length; i++) {
// top前面的这一位,代表什么数字
long num1 = (long) ((long)(by[i]) * Math.pow((long)top,(long)(by.length - i - 1)));
// 循环bottom,从前往后,一旦发现,往里面+1
for (int j = 0; j < bs.length; j++) {
// bottom每位代表的数值
long num2 = (long) Math.pow((long)bottom,(long)(bs.length - j - 1));
// 判断塞1
if (num2 <= num1 && num1 != 0){
bs[j]+=(num1/num2);
num1-=(num1/num2)*num2;
if (num1 == 0) break;
}
}
}
// 进位整理
for (int i = bs.length - 1; i >= 0; i--) {
for (int j = 0; j < (bs[i]/bottom); j++) {
bs[i]-=bottom;
bs[i-1]++;
}
}
}
}