12. Integer to Roman

最新推荐文章于 2024-01-03 14:56:38 发布

felonny

最新推荐文章于 2024-01-03 14:56:38 发布

阅读量174

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/felonny/article/details/62949064

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，输入范围限制在1到3999之间。通过定义基本的罗马数字字符及对应的数值，采用减法原理构建转换流程。

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

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.
解析：首先要清楚罗马数字的组成：
基本字符：
　I、V、X、L、C、D、M
int[] nums = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
String[] roms = {“M”, “CM”, “D”, “CD”, “C”, “XC”, “L”, “XL”, “X”, “IX”, “V”, “IV”, “I”};

public class Solution {
    public String intToRoman(int num) {
        int[] nums    = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        String[] roms = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
        String res = "";

        int loc = 0;
        while (num > 0) {
            if (num >= nums[loc]) {
                num -= nums[loc];
                res += roms[loc];
            }
            else {
                loc ++;
            }
        }

        return res;
    }
}