LeetCode题解 第十一周

1.Integer to Roman


Given an integer, convert it to a roman numeral.

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


Difficulty:Medium

1.这道题目其实是比较简单的,我们只要找到罗马数字的基本数字就行了,就好像阿拉伯数字的基本数字是0-9,其他数字都是由这十个数字组合而成的。找到这些罗马数字的基本数字之后我们就可以将整型数字用罗马数字表示了。因为题目中说明转换的范围时1到3999,因此罗马数字的基本数字可以用枚举的方法全部找出来。

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

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值