码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode——Integer to Roman

时间:2015-10-01 14:00:27      阅读:131      评论:0      收藏:0      [点我收藏+]

标签:

Description:

Given an integer, convert it to a roman numeral.

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

noting to say.

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

 

LeetCode——Integer to Roman

标签:

原文地址:http://www.cnblogs.com/wxisme/p/4850902.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!