LeetCode12：Integer to Roman

最新推荐文章于 2022-12-16 00:28:08 发布

zhihua_bupt

最新推荐文章于 2022-12-16 00:28:08 发布

阅读量598

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode DataStructure&Algorithms C++ LeetCode算法分析

本文链接：https://blog.youkuaiyun.com/geekmanong/article/details/49497915

C++ 同时被 3 个专栏收录

133 篇文章

订阅专栏

DataStructure&Algorithms

131 篇文章

订阅专栏

LeetCode算法分析

128 篇文章

订阅专栏

本文提供了一个使用C++编程语言将整数转换为罗马数字的算法实现，确保输入范围在1到3999之间。通过定义特定的罗马数字数组和循环操作，该算法有效地实现了整数到罗马数字的转换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an integer, convert it to a roman numeral.

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

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;

class Solution {
public:
		string intToRoman(int num) {
			string roman[4][10] = {
			{ "", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX" },
			{ "", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC" },
			{ "", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM" },
			{ "", "M", "MM", "MMM" }
		};

		string ret = "";
		int digit = 0;
		while (num != 0) {
			int remain = num % 10;//最低位
			ret = roman[digit][remain] + ret;
			digit++;
			num /= 10;//除去最低位
		}

		return ret;
	}
};

int main()
{
	int n = 3999;
	Solution  sol;
    string t = sol.intToRoman(n);
	cout << t << endl;
	system("pause");
	return 0;
}