[leetcode] 12.Integer to Roman

最新推荐文章于 2022-10-20 18:00:00 发布

白雪忆青竹

最新推荐文章于 2022-10-20 18:00:00 发布

阅读量288

点赞数

分类专栏： leetcode 文章标签：字符串

本文链接：https://blog.csdn.net/u014673347/article/details/48104363

版权

leetcode 专栏收录该内容

234 篇文章 0 订阅

订阅专栏

题目：
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 table[30] = {"I","II","III","IV","V","VI","VII","VIII","IX",
                            "X","XX","XXX","XL","L","LX","LXX","LXXX","XC",
                            "C","CC","CCC","CD","D","DC","DCC","DCCC","CM",
                            "M","MM","MMM"    
                             };
        int temp = num;
        int count = 0;
        while(temp > 0) {
            count++;
            temp /= 10;
        }
        int high = pow(10, count - 1);
        string result = "";
        while(num > 0) {
            int index = num / high;
            result = (index > 0)?result + table[(count - 1)*9 + index - 1]:result;
            num %= high;
            high /= 10;
            count--;
        }
        return result;
    }
};