LeetCode - 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.

通常情况下，罗马数字中小的数字在大的数字的右边。
但存在特例，以下六种情况：
IV(4) IX(9)
XL(40) XC(90)
CD(400) CM(900)

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.

代码

---

class Solution {
public int romanToInt(String s) {
        HashMap<String,Integer> map=new HashMap();
        map.put("I", 1);
        map.put("IV", 4);
        map.put("V", 5);
        map.put("IX", 9);
        map.put("X", 10);
        map.put("XL", 40);
        map.put("L", 50);
        map.put("XC", 90);
        map.put("C", 100);
        map.put("CD", 400);
        map.put("D", 500);
        map.put("CM", 900);
        map.put("M", 1000);

        int ans=0;
        for (int i=0;i<s.length();){
            if (i+1<s.length()&&map.containsKey(s.substring(i,i+2))){
                ans+=map.get(s.substring(i,i+2));
                i+=2;
            }else {
                ans+=map.get(s.substring(i,i+1));
                i++;
            }
        }
        return ans;
    }
}

class Solution {
    public int romanToInt(String s) {
        int sum = 0;
        int perNum = getValue(s.charAt(0));
        for (int i = 1; i < s.length(); i++) {
            int num = getValue(s.charAt(i));
            if (perNum >= num) {
                sum += perNum;
            } else {
                sum -= perNum;
            }
            perNum = num;
        }
        sum += perNum;
        return sum;
    }

    private int getValue(char ch) {
        switch (ch) {
            case 'I':
                return 1;
            case 'V':
                return 5;
            case 'X':
                return 10;
            case 'L':
                return 50;
            case 'C':
                return 100;
            case 'D':
                return 500;
            case 'M':
                return 1000;
            default:
                return 0;
        }
    }
}

解题思路

---

• 提前处理

  1. 将特殊的六个数预处理：IV(4) IX(9) XL(40) XC(90) CD(400) CM(900)

  2. 对字符串进行遍历

     • 遍历两个字符串（优先）：当出现两个匹配字符串，ans累加结果，i后移两位。

     • 遍历一个字符串（否则）：当出现一个匹配字符串，ans累加结果，i后移一位。

  3. 遍历结束返回结果 ans。

---

• 直接计算

  • 把一个小值放在大值的左边，就是做减法，否则为加法。

  • 当前一个字符比后一个字符小，所得的数为大减小（后减前）。

    • IV(4=5-1) IX(9=10-1) XL(40) XC(90) CD(400) CM(900)

  • 当前一个字符比后一个字符大，所得的数为大加小（后加前）。

  • 当没有下一位时，做加法即可。