Leetcode 12. Integer to Roman

最新推荐文章于 2022-10-20 18:00:00 发布

原创最新推荐文章于 2022-10-20 18:00:00 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#math

Leetcode 专栏收录该内容

278 篇文章

订阅专栏

在这里插入图片描述
方法1: 这题我们可以枚举出所有罗马数字的组合，然后遍历num。时间复杂1，因为最多output长度为15，是一个定值。空间复杂1.

class Solution {
    public String intToRoman(int num) {
        int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};    
        String[] symbols = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
        StringBuilder sb = new StringBuilder();
        while(num > 0){
            for(int i = 0; i < values.length; ++i){
                if(values[i] <= num){
                    sb.append(symbols[i]);
                    num -= values[i];
                    break;
                }
            }
        }
        return sb.toString();
    }
}