leetcode Integer to Roman 难度系数3 3.5
2014-01-28 12:03
369 查看
Question：
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
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) {
StringBuffer result = new StringBuffer();
String[] Roman = { "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X",
"IX", "V", "IV", "I" };
int[] number = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };
for(int i =0;num!=0;i++){
while(num>=number[i]){
num-=number[i];
result.append(Roman[i]);
}
}
return result.toString();
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode Roman to Integer 2.5 难度系数2
- leetcode String to Integer (atoi) 2.3 难度系数2
- leetcode-Roman to Integer
- leetcode 13 Roman to Integer
- LeetCode之Integer to Roman, Roman to Integer
- LeetCode:Roman to Integer,Integer to Roman
- leetcode-Integer to Roman
- leetcode 12 Integer to Roman
- LEETCODE: Integer to Roman
- leetcode 12. Integer to Roman
- leetcode系列（四）：罗马数Roman to Integer
- LeetCode:Integer to Roman
- leetcode 13 Roman to Integer
- leetcode笔记：Roman to Integer
- leetcode Integer to Roman
- leetcode之旅（11）-Integer to Roman
- LeetCode 012 Integer to Roman
- LeetCode - 12. Integer to Roman
- leetcode: Integer to Roman
- leetcode Convert Sorted Array to Binary Search Tree 2.20 难度系数2