13. Roman to Integer

最新推荐文章于 2022-03-19 13:18:35 发布

luo-chuang

最新推荐文章于 2022-03-19 13:18:35 发布

阅读量351

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/hardcum/article/details/50774116

版权

leetcode 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

Given an integer, convert it to a roman numeral.

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

code

public class Solution {
    public String intToRoman(int num) {
        String[][] roman = {
                { "", "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" } };

        String ret = "";
        int digit = 0;
        while (num != 0) {
            int remain = num % 10;
            ret = roman[digit][remain] + ret;
            digit++;
            num /= 10;
        }
        return ret;
    }
}