【Java】进制转换工具类，个人模拟手写

 当前进制，转目标进制！

import java.util.Stack;

public class 进制转换 {
	
	public static final int[] TABLE_LETTER = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 
											  21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35}; //字母对应数字表
	public static final char[] TABLE_NUMBER = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 
											   'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 
											   'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; //全进制表，默认大写

	public static void main(String[] args) {
		String n = "2022";
		System.out.println(radixChange(n, 9, 10));
	}
	
	public static String radixChange(String n, int radix, int targetRadix) {
		long decimal = 0;
		boolean negative = n.charAt(0) == '-'; //检查负数
		int end = negative ? 1 : 0;
		for (int i = n.length() - 1, pow = 0; i >= end; i--, pow++) { //把任何进制都转成十进制
			int c = toInt(n.charAt(i));
			decimal = decimal + c * quickPow(radix, pow); //次幂变成十进制公式
		}
		Stack<Character> stack = new Stack<>(); //进制除法，得到的是先进后出数据
		while (decimal > 0) {
			stack.push(TABLE_NUMBER[(int) (decimal % targetRadix)]); //十进制除法转其它进制
			decimal /= targetRadix;
		}
		if (negative) stack.push('-');
		char[] arr = new char[stack.size()];
		for (int i = 0; i < arr.length; i++) arr[i] = stack.pop(); //装容器
		return new String(arr);
	}
	
	public static long quickPow(long n, long pow) {
		long result = n == 0 ? 0 : n < 0 ? -1 : 1; //初始值
		if (n < -1 || (n > 1)) { //补丁
			while (pow > 0) { //快速扩底降幂
				if ((pow & 1) == 1) result = result * n;
				n = n * n;
				pow >>= 1;
			}
		}
		return result;
	}
	
	public static int toInt(char c) { //转成字母对应下标，不使用加法去转换，使用表
		int result = -1;
		if (c >= 'a' && c <= 'z') {
			result = TABLE_LETTER[c - 'a'];
		} else if (c >= 'A' && c <= 'Z') {
			result = TABLE_LETTER[c - 'A'];
		} else if (c >= '0' && c <= '9') {
			result = c - '0';
		}
		return result;
	}

}

输出：

1478