Leetcode 12. Integer to Roman

最新推荐文章于 2022-10-20 18:00:00 发布

SnailTyan

最新推荐文章于 2022-10-20 18:00:00 发布

阅读量169

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.youkuaiyun.com/Quincuntial/article/details/81912626

Leetcode 同时被 2 个专栏收录

409 篇文章

订阅专栏

Algorithm

260 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现。通过定义字符串数组来对应罗马数字的不同位数表示，该算法能高效地完成转换任务。适用于初学者了解罗马数字的构成规则及C++编程实践。

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

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Integer to Roman

2. Solution

class Solution {
public:
    string intToRoman(int num) {
        const int TEN = 10;
        const int HUNDRED = 100;
        const int THOUSAND = 1000;
        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/THOUSAND] + C[(num%THOUSAND)/HUNDRED]+ X[(num%HUNDRED)/TEN] + I[num%TEN];
    }
};