[LeetCode] 036: Integer to Roman

最新推荐文章于 2022-03-25 19:34:53 发布

1.02^365的成长裂变

最新推荐文章于 2022-03-25 19:34:53 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925148

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[Problem]

Given an integer, convert it to a roman numeral.

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

[Solution]

class Solution {
public:
    string intToRoman(int num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function    
        string res = "";
        string romanTable[13] = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
        int intTable[13] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        for(int i = 0; i < 13; ++i){
            if(num >= intTable[i]){
                while(num >= intTable[i]){
                    res += romanTable[i];
                    num -= intTable[i];
                }
            }
        }
        return res;
    }
};