Integer to Roman - Leetcode

最新推荐文章于 2019-02-25 14:46:35 发布

原创最新推荐文章于 2019-02-25 14:46:35 发布 · 498 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

103 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现。通过定义基数和对应的罗马符号，该方法逐步分解输入整数并构建正确的罗马数字表示。

这个了解原理，从大到小一点点测，然后相应的改变当前值，即可。

public class Solution {
    public String intToRoman(int num) {
	   int[] radix = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
	   String[] symbol = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
	   String result = "";
	   int i=0;
	   while(num>0){
	       int count = num/radix[i];
	       num %= radix[i];
	       while(count>0){
	           result += symbol[i];
	           count --;
	       }
	       i++;
	   }
	   return result;
    }
}

Given an integer, convert it to a roman numeral.

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