12. Integer to Roman

最新推荐文章于 2025-08-21 20:43:22 发布

SnailRunFast

最新推荐文章于 2025-08-21 20:43:22 发布

阅读量157

点赞数

CC 4.0 BY-SA版权

分类专栏： Leet Code 文章标签： Integer to Roman leetcode

本文链接：https://blog.youkuaiyun.com/snailrunfast/article/details/69666063

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种使用递归方法将整数转换为罗马数字的算法，并提供了详细的Java代码实现。该方法适用于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.

Subscribe to see which companies asked this question.

Solution:

Tips:

solve this problem with recursion, just for practice.

Java Code:

public class Solution {
    public String intToRoman(int num) {
        if (num <= 0) {
            return "";
        }
        
        if (num >= 900) {
            return num >= 1000 ? "M" + intToRoman(num - 1000) : "CM" + intToRoman(num - 900);
        } else if (num >= 400) {
            return num >= 500 ? "D" + intToRoman(num - 500) : "CD" + intToRoman(num - 400);
        } else if (num >= 90) {
            return num >= 100 ? "C" + intToRoman(num - 100) : "XC" + intToRoman(num - 90);
        } else if (num >= 40) {
            return num >= 50 ? "L" + intToRoman(num - 50) : "XL" + intToRoman(num - 40);
        } else if (num >= 9) {
            return num >= 10 ? "X" + intToRoman(num - 10) : "IX" + intToRoman(num - 9);
        } else if (num >= 4) {
            return num >= 5 ? "V" + intToRoman(num - 5) : "IV" + intToRoman(num - 4);
        } else {
            return "I" + intToRoman(num - 1);
        }
    }
}