LeetCode——整数转罗马数字

最新推荐文章于 2024-07-24 22:13:06 发布

KGF886

最新推荐文章于 2024-07-24 22:13:06 发布

阅读量125

点赞数

分类专栏：数据结构与算法文章标签：算法 leetcode

本文链接：https://blog.csdn.net/weixin_45732391/article/details/121487606

版权

数据结构与算法专栏收录该内容

34 篇文章 0 订阅

订阅专栏

LeetCode——整数转罗马数字

题目链接：https://leetcode-cn.com/problems/integer-to-roman/

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