[LeetCode] Integer to Roman

最新推荐文章于 2020-06-29 15:21:54 发布

原创最新推荐文章于 2020-06-29 15:21:54 发布 · 399 阅读

0 ·

CC 4.0 BY-SA版权

Algorithm 同时被 2 个专栏收录

86 篇文章

订阅专栏

LeetCode

76 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现过程，包括使用数组存储基本罗马数字符号和相应的数值，通过遍历数组并累加对应的罗马数字来完成转换。确保输入值在1到3999的范围内。

Given an integer, convert it to a roman numeral.

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

class Solution {
public:
    string intToRoman(int num) {
        int base[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        string symbol[] = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
        string res;
        for(int i = 0; num > 0; i++)
        {
            int count = num / base[i];
            num %= base[i];
            while(count--)
                res += symbol[i];
        }
        return res;
    }
};