leetcode 12. Integer to Roman [medium][java]

inkhk

于 2019-06-14 19:55:39 发布

阅读量94

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/inkhk/article/details/92002007

版权

Integer to Roman

Example
在这里插入图片描述

Solution
Time Complexity: O(m), space complexity:O(m), where m is the symbol length

class Solution {
    public String intToRoman(int num) {
        String[] symbol = {"I", "IV", "V", "IX", "X", "XL", "L", "XC", "C", "CD", "D", "CM", "M"};
        int[] value = {1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000};
        String rev = "";
        
        for(int i = value.length-1; num > 0 && i >= 0 ;) {
            if(num >= value[i]) {
                rev += symbol[i];
                num -= value[i];
            } else {
                i--;
            }
        }

        return rev;
    }
}