LeetCode [12. Integer to Roman]

最新推荐文章于 2017-12-23 10:54:15 发布

爱你多过爱自己

最新推荐文章于 2017-12-23 10:54:15 发布

阅读量142

点赞数

分类专栏： leecode 文章标签： leetcode

本文链接：https://blog.csdn.net/a1042651820/article/details/78747716

版权

leecode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

Problem

12. Integer to Roman

Question

Given an integer, convert it to a roman numeral.

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

思路

罗马数字的详细介绍请点击这里罗马数字

思路比较简单，把数字拆解为千百十个位，每个位都对应一个罗马表示，最后把所有罗马表示组合起来。

Code

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

        return M[num/1000]+C[(num%1000)/100]+X[(num%100)/10]+I[num%10];
    }
};