LeetCode 12 Integer to Roman

最新推荐文章于 2024-07-15 21:11:11 发布

萤火虫啊飞呀飞

最新推荐文章于 2024-07-15 21:11:11 发布

阅读量397

点赞数

分类专栏： leetcode 文章标签： leetcode 罗马数字

本文链接：https://blog.csdn.net/shey666/article/details/79609535

版权

leetcode 专栏收录该内容

109 篇文章 0 订阅

订阅专栏

LeetCode 12

Integer to Roman

Problem Description：
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.
Solution:
主要是从一些特例找出一般规律，从千位、百位、十位、个位出发进行考虑（很惭愧，此解法是从leetcode-discuss学（抄）来的）

class Solution {
public:
    string intToRoman(int num) {
        vector<string> Thousands = {"", "M", "MM", "MMM"};
        vector<string> Hundreds = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
        vector<string> Tens = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
        vector<string> Digits = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
        string result = Thousands[num/1000]+Hundreds[(num%1000)/100]+Tens[(num%100)/10]+Digits[num%10];
        return result;
    }
};