04-08 leetcode-12 Integer to Roman

问题描述：Given an integer, convert it to a roman numeral.

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

问题分析：类似于十进制，从高位进行计算即可

代码：

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

04-08 leetcode-12 Integer to Roman

原文：http://blog.csdn.net/woliuyunyicai/article/details/44941035