首页 > 代码库 > [Leetcode] Integer to Roman
[Leetcode] Integer to Roman
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
Solution:
1 public class Solution { 2 public String intToRoman(int num) { 3 StringBuilder result = new StringBuilder(""); 4 if (num < 1) 5 return result.toString(); 6 int[] values = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }; 7 String[] numerals = { "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", 8 "IX", "V", "IV", "I" }; 9 for(int i=0;i<values.length;++i){10 while(num>=values[i]){11 num-=values[i];12 result.append(numerals[i]);13 } 14 }15 return result.toString();16 }17 }
[Leetcode] Integer to Roman
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。