[LeetCode] 12. Integer to Roman

Given an integer, convert it to a roman numeral.

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

public class Solution {
    public String intToRoman(int num) {
        String[][] c={
            {"","I","II","III","IV","V","VI","VII","VIII","IX"},
            {"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"},
            {"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},
            {"","M","MM","MMM"}
        };
        
        String r0 = c[0][num % 10];
        num /= 10;
        String r1 = c[1][num % 10];
        num /= 10;
        String r2 = c[2][num % 10];
        num /= 10;
        String r3 = c[3][num % 10];
        
        return r3 + r2 + r1 + r0;
    }
}