LeetCode String 13 Roman to Integer

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.

solution 1:

使用mapping的思想把character转化为integer. 转化为integer以后，发现数组中出现后一个数大于当前数时，需要做减法，否则做加法。
同时可以把转化为integer和判断数组大小关系合并到一起

    public int romanToInt(String s) {
        int len = s.length();
        HashMap<Character, Integer> map = new HashMap<>();
        char[] a = {'I','V','X','L','C','D','M'};
        int[] b = {1,5,10,50,100,500,1000};
        for (int i = 0; i < a.length; i++) {
            map.put(a[i],b[i]);
        }

        int[] res = new int[s.length()];
        for (int i = 0; i < s.length(); i++) {
            res[i] = map.get(s.charAt(i));
        }

        int out = 0;
        for (int i = 0 ; i < res.length-1; i++) {
            if (res[i+1] > res[i]) out -= res[i];
            else out += res[i];
        }
        out += res[res.length-1];
        return out;
    }