LeetCode Integer to Roman

最新推荐文章于 2025-08-20 09:37:41 发布

xyzchenzd

最新推荐文章于 2025-08-20 09:37:41 发布

阅读量501

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/xyzchenzd/article/details/25733631

LeetCode 专栏收录该内容

125 篇文章

订阅专栏

本文介绍了一种将阿拉伯数字转换为罗马数字的算法实现。通过建立字符对照表，该算法能够高效地完成1到3999范围内数字的转换。

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

题目

Given an integer, convertit to a roman numeral.

Input is guaranteed to bewithin the range from 1 to 3999.

求数字转罗马数字，可以按位查表

代码：

string 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"};

class Solution {
public:
    string intToRoman(int num) {
		string ans;
		int radix=1000;
		for(int i=3;i>=0;i--)	//由高位至低位转换
		{
			ans+=c[i][num/radix];
			num%=radix;
			radix/=10;
		}
		return ans;
    }
};