LeetCode-Integer to Roman

最新推荐文章于 2026-01-05 22:36:07 发布

原创最新推荐文章于 2026-01-05 22:36:07 发布 · 520 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Integer to Roman

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Interger

2 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的方法，并提供了一个C++实现示例。输入范围限制在1到3999之间，通过遍历预定义的数值与罗马数字对照表来完成转换。

Given an integer, convert it to a roman numeral.

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

Solution:

Code:

class Solution {
public:
    string intToRoman(int num) {
        vector<int> values = {1000, 900, 500, 400, 100,90, 50, 40, 10, 9, 5, 4, 1 };  
        vector<string> numerals = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" };
        const int length = values.size();
        string result;
        for (int i = 0; i < length; ++i) {
            while (num >= values[i]) {
                num -= values[i];
                result += numerals[i];
            }
            if (num == 0) break;
        }
        return result;
    }
};