LeetCode题目：Integer to Roman

最新推荐文章于 2021-05-03 06:51:12 发布

勺月

最新推荐文章于 2021-05-03 06:51:12 发布

阅读量195

点赞数

CC 4.0 BY-SA版权

分类专栏：算法应用作业文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/sinat_37607788/article/details/73382454

算法应用作业专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，输入范围限制在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.

Subscribe to see which companies asked this question.

代码：

class Solution {
	public:
		string intToRoman(int num) {
			char* c[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 roman;
			roman.append(c[3][num / 1000 % 10]);
			roman.append(c[2][num / 100 % 10]);
			roman.append(c[1][num / 10 % 10]);
			roman.append(c[0][num % 10]);

			return roman;
		}
};