IntegertoRoman

最新推荐文章于 2019-07-30 21:15:17 发布

原创最新推荐文章于 2019-07-30 21:15:17 发布 · 463 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法，包括使用map数据结构进行快速查找，并通过循环逐步构建罗马数字字符串。输入范围确保了算法的有效性和正确性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//============================================================================
// Given an integer, convert it to a roman numeral.
//
// Input is guaranteed to be within the range from 1 to 3999.
//============================================================================

#include <iostream>
#include <map>
#include <string>
using namespace std;

class Solution {
public:
    map<int, string> dict;
    string intToRoman(int num) {
        dict.clear();
        dict[1] = "I";
        dict[4] = "IV";
        dict[5] = "V";
        dict[9] = "IX";
        dict[10] = "X";
        dict[40] = "XL";
        dict[50] = "L";
        dict[90] = "XC";
        dict[100] = "C";
        dict[400] = "CD";
        dict[500] = "D";
        dict[900] = "CM";
        dict[1000] = "M";
        string result = "";
        for (map<int, string>::reverse_iterator it = dict.rbegin(); it != dict.rend(); it++) {
            while (num >= it->first) {
                result += it->second;
                num -= it->first;
            }
        }
        return result;
    }
};