【LeetCode-Java实现】13. Roman to Integer罗马转整数

题目描述

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.
罗马转整数规则：
前面比后面小：用后面减去前面（如IV=5-1=4）
前面比后面大：用后面加上前面（如VI=5+1=6）

思路

先用HashMap把罗马数字和阿拉伯数字的匹配起来
再从罗马数字最后一个（由上面总结的转换规则可得从最后遍历较好）开始遍历，与前一个字符对应的数值进行比较，
后面大于前面：结果=当前结果-前一个字符对应的数值
后面小于前面：结果=当前结果+前一个字符对应的数值

实现

public int romanToInt(String s) {
        //先将罗马数字和阿拉伯数字的匹配情况装进HashMap里
        HashMap<Character,Integer> map=new HashMap<>();
        map.put('I',1);   //罗马字符作为key：接下来可以通过get(key)来查找某罗马字符对应的数值
        map.put('V',5);
        map.put('X',10);
        map.put('L',50);
        map.put('C',100);
        map.put('D',500);
        map.put('M',1000);
        
    //从罗马最后一个字符开始，向前遍历。每次遍历比较后一个和前一个字符对应数值大小关系
        char[] c=s.toCharArray();
        int len=c.length;
        int res=map.get(c[len-1]);  //res用来存放最终的整数结果，初始值是最后一个字符对应的数值
        //从倒数第二个开始向前遍历并比较
        for(int i=len-2;i>=0;i--){
            //若后面大于前面，结果=当前结果-前面
            if(map.get(c[i])<map.get(c[i+1])){
                res=res-map.get(c[i]);
            }
            //若后面小于前面，结果=当前结果+前面
            else{
                res=res+map.get(c[i]);
            }
        } 
        return res;
    }

提交结果（有点慢）
Success
Details
Runtime: 7 ms, faster than 36.13% of Java online submissions for Roman to Integer.
Memory Usage: 36.3 MB, less than 99.96% of Java online submissions for Roman to Integer.