leetcode[12]Integer to Roman
2015-02-10 13:46
399 查看
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
Input is guaranteed to be within the range from 1 to 3999.
public class Solution { public String intToRoman(int num) { 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 res = new StringBuilder(); for(int i=0;i<values.length;i++) { while(num>=values[i]) { num-=values[i]; res.append(numerals[i]); } } return res.toString(); } }
相关文章推荐
- [leetcode 12] Integer to Roman
- Leetcode_12_Integer to Roman
- LeetCode 12 - Integer to Roman
- [Leetcode] 12. Integer to Roman
- [Leetcode 44] 12 Integer To Roman
- leetcode12 Integer to Roman
- LeetCode12: Integer to Roman
- Leetcode 12 Integer to Roman整数变罗马
- leetcode 12 Integer to Roman
- [Leetcode] 12 - Integer to Roman
- LeetCode 12 integer to roman
- [LeetCode]12.Integer to Roman
- LeetCode 12 Integer to Roman(C,C++,Java,Python)
- [LeetCode]12 Integer to Roman
- Integer to Roman_Leetcode_#12
- [LeetCode 12] Integer to Roman
- leetcode.12----------Integer to Roman
- [C++]LeetCode 12: Integer to Roman(将整数转换为罗马数字)
- LeetCode 12 - Integer to Roman
- LeetCode12~14 Integer to Roman/Roman to Integer/Longest Common Prefix