Leetcode 12. 整数转罗马数字- java实现

最新推荐文章于 2024-10-05 12:29:44 发布

依嘫_吃代码

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量247

点赞数

分类专栏： LeetCode 文章标签： leetcode java 贪心算法

本文链接：https://blog.csdn.net/qq_41810415/article/details/124623069

版权

贪心算法罗马数字 intToRoman 字符串拼接数值转换

关键词由CSDN通过智能技术生成

LeetCode 专栏收录该内容

158 篇文章 4 订阅

订阅专栏

贪心

原题链接

在这里插入图片描述

提示：

1 <= num <= 3999

代码案例1：输入: num = 3
输出: “III”
输入: num = 58
输出: “LVIII”
解释: L = 50, V = 5, III = 3.
输入: num = 1994
输出: “MCMXCIV”
解释: M = 1000, CM = 900, XC = 90, IV = 4.

题解(照搬y总的题解)

在这里插入图片描述

class Solution {
    static String[]  s = new String [] {"I","IV","V","IX","X","XL","L","XC","C","CD","D","CM","M"};
    static int[] a = new int[]{1,4,5,9,10,40,50,90,100,400,500,900,1000};
    public String intToRoman(int num) {     
        String res = "";
        for(int i = 12 ; i >= 0 ;i--){
            while(num >= a[i]){
                num -= a[i] ;
                res += s[i] ;
            }
        }
        return res ;
    }
}