LeetCode 12 整数转罗马数字

LeetCode 12 整数转罗马数字

、、、、、、、、、、、在这里插入图片描述
在这里插入图片描述

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

class Solution {
    public String intToRoman(int num) {
        StringBuffer s = new StringBuffer();
        while (num != 0) {
            if (num >= 1000) {
                s.append("M");
                num -= 1000;
            } else if (num >= 900) {
                s.append("CM");
                num -= 900;
            } else if (num >= 500) {
                s.append("D");
                num -= 500;
            } else if (num >= 400) {
                s.append("CD");
                num -= 400;
            } else if (num >= 100) {
                s.append("C");
                num -= 100;
            } else if (num >= 90) {
                s.append("XC");
                num -= 90;
            } else if (num >= 50) {
                s.append("L");
                num -= 50;
            } else if (num >= 40) {
                s.append("XL");
                num -= 40;
            } else if (num >= 10) {
                s.append("X");
                num -= 10;
            } else if (num >= 9) {
                s.append("IX");
                num -= 9;
            } else if (num >= 5) {
                s.append("V");
                num -= 5;
            } else if (num >= 4) {
                s.append("IV");
                num -= 4;
            } else if (num >= 1) {
                s.append("I");
                num -= 1;
            }
        }
        return s.toString();
    }
}

发布了16 篇原创文章 · 获赞 0 · 访问量 811

猜你喜欢

转载自blog.csdn.net/qq_43721113/article/details/101678513