LeetCode12: Integer to Roman

最新推荐文章于 2022-12-16 00:28:08 发布

huazi0204

最新推荐文章于 2022-12-16 00:28:08 发布

阅读量274

点赞数

分类专栏： LeetCode 文章标签： Leetcode leetcode LeetCode

本文链接：https://blog.csdn.net/huazi0204/article/details/8592948

版权

LeetCode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

public class Solution {
    public String intToRoman(int num) {
        // Start typing your Java solution below
        // DO NOT write main() function
        char[] romanC = {'M', 'D', 'C', 'L', 'X', 'V', 'I'};
        int[] base = {1000, 500, 100, 50, 10, 5, 1};
        int i=0;
        int count=0;
        String romanStr="";
        while(i<romanC.length){
            if(num-base[i]>=0){
                num-=base[i];
                count++;
            }
            else{
                String tmpStr="";
                if(count==4){
                    tmpStr += romanC[i];
                    tmpStr += romanC[i-1];
                    count=0;
                }
                else if(count>=5 && count<9){
                    tmpStr += romanC[i-1];
                    count-=5;
                }
                else if(count==9){
                    tmpStr += romanC[i];
                    tmpStr += romanC[i-2];
                    count=0;
                }
                while(count>0){
                    tmpStr+=romanC[i];
                    count--;
                }
                romanStr += tmpStr;
                i+=2;
                count=0;
            }
        }
        return romanStr;
    }
}