Leetcode解题笔记之（12）-- Integer to Roman [Medium]

cjinchan

于 2018-12-30 20:39:44 发布

阅读量116

点赞数

分类专栏： leetcodeC语言

本文链接：https://blog.csdn.net/cjinchan/article/details/85408792

版权

leetcodeC语言专栏收录该内容

15 篇文章 1 订阅

订阅专栏

解题思路

题意很简单,最基本的有1,5,10,50,100,500,1000.其他的需要特殊处理的有4,9,49,90,400,900.
所以建立映射关系{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1},依次从大到小检查即可.

代码

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