题解 | #进制转换#思路 M % N 倒序排序

import java.util.*;


public class Solution {
    /**
     * 进制转换
     * @param M int整型 给定整数
     * @param N int整型 转换到的进制
     * @return string字符串
     */
    public String solve (int M, int N) {
        // write code here
        if (M == 0) {
            return "0";
        }
        //思路 M % N 倒序排序
        StringBuilder sb = new StringBuilder();
        String tag = "0123456789ABCDEF";
        boolean isFu = false;
        if (M < 0) {
            M = -M;
            isFu = true;
        }
        while (M != 0) {
            int less = M % N;
            sb.append(tag.charAt(less));
            M = M / N;
        }
        if (isFu) {
            sb.append("-");
        }
        return sb.reverse().toString();
    }
}