LeetCode--integer-to-roman

最新推荐文章于 2020-02-25 17:04:41 发布

原创最新推荐文章于 2020-02-25 17:04:41 发布 · 359 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #C++

LeetCode 专栏收录该内容

148 篇文章

订阅专栏

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