LeetCode#12 Integer to Roman

Problem Definition:

Given an integer, convert it to a roman numeral.

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

Solution:

1）思路基本上就是这个样子，不过因为输入的整数最大不到4000，所以可以直接把循环给拆了。

# @param {integer} num
# @return {string}
def intToRoman(self, num):
dicIntToRoman={1:'I',5:'V',10:'X',50:'L',100:'C',500:'D',1000:'M'}
dicIntToArr={1:[1],2:[1,1],3:[1,1,1],4:[1,5],5:[5],6:[5,1],7：[5,1,1],8:[5,1,1,1],9:[1,10]}
pz=1000
roman=''
while num!=0:
a=num/pz
num=num%pz
if a==0:
pz/=10
continue
arr=dicIntToArr[a]
for c in arr:
roman+=dicIntToRoman[pz*c]
pz/=10
return roman

2）

public static String intToRoman(int num) {
String M[] = {"", "M", "MM", "MMM"};
String C[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
String X[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
String I[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
return M[num/1000] + C[(num%1000)/100] + X[(num%100)/10] + I[num%10];
}