012_LeetCode_12 Integer to Roman 题解

最新推荐文章于 2024-07-05 16:42:37 发布

夕舞雪薇

最新推荐文章于 2024-07-05 16:42:37 发布

阅读量193

点赞数

分类专栏： LeetCode题解文章标签： leetcode

本文链接：https://blog.csdn.net/fzy1993/article/details/78698209

版权

LeetCode题解专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Description

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

将一个整数转换成罗马数字。

tips:

罗马数字表示如下：1 -> I, 5 -> V, 10 -> X, 50 -> L, 100 -> C, 500 -> D, 1000 -> M.

解：

数字最大不到4000，直接打表，岂不是。。。。。。。。。。。。。。

java代码：

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