[LeetCode] Integer to Roman

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

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

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，输入范围限制在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) {
        string str;
        string symbol[]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
        int value[]=    {1000,900,500,400, 100, 90,  50, 40,  10, 9,   5,  4,   1};
        for(int i = 0;num != 0;i ++){
            while(num >= value[i]){
                str += symbol[i];
                num -= value[i];
            }
        }
        return str;   
    }
};

参考