zoukankan      html  css  js  c++  java
  • 12. Integer to Roman (JAVA)

    Roman numerals are represented by seven different symbols: IVXLCD 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.
    class Solution {
        public String intToRoman(int num) {
            int len;
            String str="";
            int[] val = {1000,500,100,50,10,5,1};
            char[] sym = {'M','D','C','L','X','V','I'};
            for(int i = 0; i < val.length; i+=2){
                len = num/val[i];
                if(len <=3 ){ //0-3
                    for(int j = 0; j < len; j++){
                        str += sym[i];
                    }
                }
                else if(len == 4){ //4
                    str = str + sym[i] + sym[i-1];
                }
                else if(len <= 8){ //5-8
                    str += sym[i-1];
                    for(int j = 5; j < len; j++){
                        str += sym[i];
                    }
                }
                else{ //9
                    str = str + sym[i] + sym[i-2];
                }
                num %= val[i];
            }
            return str;
        }
    }

    解题思路:

    使用两个对应的数组,以减少代码的重复量

  • 相关阅读:
    python中的线程(zz)
    Bzoj1014 外星人Prefix
    ABC
    终于明白阿里百度这样的大公司,为什么面试经常拿ThreadLocal考验求职者了
    我去面试没带简历,你让我走人?
    利用Python框架pyxxnet_project实现的网络服务
    我以为我对Mysql索引很了解,直到我遇到了阿里的面试官
    CSS必备知识大全
    致 Python 初学者
    从入门到精通,Java学习路线导航
  • 原文地址:https://www.cnblogs.com/qionglouyuyu/p/10768895.html
Copyright © 2011-2022 走看看