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.

将阿拉伯数字转换成罗马数字(小于3999)

看了一下罗马数字的写法(维基百科),按个十百千位处理

public class A12IntegertoRoman {
	// I(1),V(5),X(10),L(50),C(100),D(500),M(1000)
	public String intToRoman(int num) {
		StringBuffer roman = new StringBuffer("");
		int n = 1; // 位数
		int c = 0;
		String[] r = new String[3];
		while(num > 0) {
			c = num % 10;
			num /= 10;
			switch(n) {
			case 1:
				r[0] = "I"; r[1] = "V"; r[2] = "X";
				break;
			case 2:
				r[0] = "X"; r[1] = "L"; r[2] = "C";
				break;
			case 3:
				r[0] = "C"; r[1] = "D"; r[2] = "M";
				break;
			case 4:
				r[0] = "M"; r[1] = null; r[2] = null;
				break;
			}
			if(c == 9) {
				roman.insert(0, r[0] + r[2]);
			} else if(c >= 5) {
				String str = r[1];
				while(c - 5 > 0) {
					str += r[0];
					c--;
				}
				roman.insert(0, str);
			} else if(c == 4) {
				roman.insert(0, r[0] + r[1]);
			} else {
				String str = "";
				while(c > 0) {
					str += r[0];
					c--;
				}
				roman.insert(0, str);
			}
			n++;
		}
		return roman.toString();
	}
}

或者直接写成数组

public String intToRoman_1(int num) {
	String[][] ans = {
			{"", "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" }
			};
	return ans[3][num / 1000] + ans[2][num / 100 % 10]
			+ ans[1][num / 10 % 10] + ans[0][num % 10];
}