leetcode-12. Integer to Roman

myan991

于 2017-03-04 18:17:40 发布

阅读量176

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/myan991/article/details/60335622

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现。通过定义罗马数字对应的整数值和字符串，使用循环减法的方式逐步减少输入整数直至归零，并在此过程中构造出相应的罗马数字表示。

leetcode-12. Integer to Roman

Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
Subscribe to see which companies asked this question.

class Solution {
public:
    string intToRoman(int num) {
        string str = "";
        vector<string> roman = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
        vector<int> integer = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        for(int i = 0; i < integer.size(); i++){
            while(num >= integer[i]){          //第一个是要用while 不是if，第二个是>=, 不要忘了＝
                num -= integer[i];
                str += roman[i];
            }
        }
        return str;
    }
};