12. 整数转罗马数字

huuuuufei

于 2021-03-17 21:17:13 发布

阅读量100

点赞数

分类专栏： leetcode算法合集

本文链接：https://blog.youkuaiyun.com/qq_40622253/article/details/114950323

版权

leetcode算法合集专栏收录该内容

15 篇文章

订阅专栏

在这里插入图片描述

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