Leetcode 12. Integer to Roman

方法1: 这题我们可以枚举出所有罗马数字的组合，然后遍历num。时间复杂1，因为最多output长度为15，是一个定值。空间复杂1.

class Solution {
     
    public String intToRoman(int num) {
     
        int[] values = {
     1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};    
        String[] symbols = {
     "M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
        StringBuilder sb = new StringBuilder();
        while(num > 0){
     
            for(int i = 0; i < values.length; ++i){
     
                if(values[i] <= num){
     
                    sb.append(symbols[i]);
                    num -= values[i];
                    break;
                }
            }
        }
        return sb.toString();
    }
}

总结：

• 无