LeetCode 12. Integer to Roman

最新推荐文章于 2022-10-20 18:00:00 发布

风雪夜不眠人

最新推荐文章于 2022-10-20 18:00:00 发布

阅读量212

点赞数

分类专栏： LeetCode 文章标签： LeetCode C++

本文链接：https://blog.csdn.net/qq_33519317/article/details/94874543

版权

LeetCode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

//C++
string intToRoman(int num)
{
	string result = "";
	while (num > 0)
	{
		if (num >= 1000)
		{
			result = result + 'M'; num = num - 1000;
		}
		if (num < 1000 && num>=900)
		{
			result = result + "CM"; num = num - 900;
		}
		if (num < 900 && num >= 500)
		{
			result = result + 'D'; num = num - 500;
		}
		if (num < 500 && num >= 400)
		{
			result = result + "CD"; num = num - 400;
		}
		if (num < 400 && num >= 100)
		{
			result = result + 'C'; num = num - 100;
		}
		if (num < 100 && num >= 90)
		{
			result = result + "XC"; num = num - 90;
		}
		if (num < 90 && num >= 50)
		{
			result = result + "L"; num = num - 50;
		}
		if (num < 50 && num >= 40)
		{
			result = result + "XL"; num = num - 40;
		}
		if (num < 40 && num >= 10)
		{
			result = result + "X"; num = num - 10;
		}
		if (num == 9)
		{
			result = result + "IX"; num = num - 9;
		}
		if (num < 9 && num >= 5)
		{
			result = result + "V"; num = num - 5;
		}
		if (num == 4)
		{
			result = result + "IV"; num = num - 4;
		}
		if (num < 4 && num > 0)
		{
			result = result + "I"; num = num - 1;
		}
	}
	return result;
}

//Java
class Solution {
    public String intToRoman(int num) {
        String s="";
        String [] LuoMa={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","III","II","I"};
        int [] N={1000,900,500,400,100,90,50,40,10,9,5,4,3,2,1};
        while(num>0)
        {
            int i=0;
            while (num<N[i])
            {
                i++;
            }
            num=num-N[i];
            s=s+LuoMa[i];
        }
        return s;
    }
}