LeetCode #12 Integer to Roman (M)

[Problem]

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

 

[Analysis]

由于题目提示输入的范围是1至3999，这题我采用了暴力思路：建立一个integer和roman numeral的map，使用一个loop来建造对应字符串即可。

 

[Solution]

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