LeetCode 12. Integer to Roman

da_kao_la

于 2019-03-03 20:04:36 发布

阅读量99

点赞数

分类专栏： LeetCode 文章标签： LeetCode Medium Java

本文链接：https://blog.csdn.net/da_kao_la/article/details/88092847

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

题目来源：https://leetcode.com/problems/integer-to-roman/

问题描述

12. Integer to Roman

Medium

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol Value

I 1

V 5

X 10

L 50

C 100

D 500

M 1000

For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

I can be placed before V (5) and X(10) to make 4 and 9.
X can be placed before L (50) and C(100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: 3

Output: "III"

Example 2:

Input: 4

Output: "IV"

Example 3:

Input: 9

Output: "IX"

Example 4:

Input: 58

Output: "LVIII"

Explanation: L = 50, V = 5, III = 3.

Example 5:

Input: 1994

Output: "MCMXCIV"

Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

------------------------------------------------------------

题意

转换阿拉伯数字（1~3999）到罗马数字。

------------------------------------------------------------

思路

维护两个表，一个是阿拉伯标准数字表，一个是罗马数字标准表，下标对应（注意4,9,40,90,400,900也是标准数字）。从表中大端遍历，找到小于等于当前输入数字的最大的标准数字，再把输入数字减去这个标准阿拉伯数字，循环直到输入数字减小到0.

------------------------------------------------------------

代码

class Solution {
    final public int[] ARBIC = {1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000};
    final public String[] ROMAN = {"I", "IV", "V", "IX", "X", "XL", "L", "XC", "C", "CD", "D", "CM", "M"};
    
    public String intToRoman(int num) {
        int i = 0, res = num, LEN = ARBIC.length;
        StringBuilder sb = new StringBuilder();
        while (res > 0)
        {
            for (i=LEN-1; i>=0; i--)
            {
                if (res >= ARBIC[i])
                {
                    sb.append(ROMAN[i]);
                    res -= ARBIC[i];
                    break;
                }
            }
        }
        return sb.toString();
    }
}