美文网首页
LeetCode 13—Roman to Integer(罗马数

LeetCode 13—Roman to Integer(罗马数

作者: 灯火葳蕤234 | 来源:发表于2019-03-06 21:03 被阅读0次

    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 a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

    Example 1:
    Input: "III"
    Output: 3
    
    Example 2:
    Input: "IV"
    Output: 4
    
    Example 3:
    Input: "IX"
    Output: 9
    
    Example 4:
    Input: "LVIII"
    Output: 58
    Explanation: L = 50, V= 5, III = 3.
    
    Example 5:
    Input: "MCMXCIV"
    Output: 1994
    Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
    

    题意:罗马数字 2 写做 II ,即为两个并列的 1。12 写做 XII ,即为 X + II 。 27 写做 XXVII, 即为 XX + V + II 。
    通常情况下,罗马数字中小的数字在大的数字的右边。但也存在特例,例如 4 不写做 IIII,而是 IV。数字 1 在数字 5 的左边,所表示的数等于大数 5 减小数 1 得到的数值 4 。同样地,数字 9 表示为 IX。这个特殊的规则只适用于以下六种情况:
    I 可以放在 V (5) 和 X (10) 的左边,来表示 4 和 9。
    X 可以放在 L (50) 和 C (100) 的左边,来表示 40 和 90。
    C 可以放在 D (500) 和 M (1000) 的左边,来表示 400 和 900。
    给定一个罗马数字,将其转换成整数。输入确保在 1 到 3999 的范围内。
    代码:

    class Solution {
        public int romanToInt(String s) {
            int sum=0;
            if(s.indexOf("IV")!=-1){sum-=2;}
            if(s.indexOf("IX")!=-1){sum-=2;}
            if(s.indexOf("XL")!=-1){sum-=20;}
            if(s.indexOf("XC")!=-1){sum-=20;}
            if(s.indexOf("CD")!=-1){sum-=200;}
            if(s.indexOf("CM")!=-1){sum-=200;}
    
            char c[]=s.toCharArray();
            int count=0;
            for(;count<=s.length()-1;count++){
                if(c[count]=='M') sum+=1000;
                if(c[count]=='D') sum+=500;
                if(c[count]=='C') sum+=100;
                if(c[count]=='L') sum+=50;
                if(c[count]=='X') sum+=10;
                if(c[count]=='V') sum+=5;
                if(c[count]=='I') sum+=1;
            }
            return sum;
        }
    }
    

    相关文章

      网友评论

          本文标题:LeetCode 13—Roman to Integer(罗马数

          本文链接:https://www.haomeiwen.com/subject/nkcfpqtx.html