LeetCode 13. Roman to Integer（罗马数字转阿拉伯数字）

原题网址：https://leetcode.com/problems/roman-to-integer/

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

方法：理解罗马数字。

public class Solution {
    public int romanToInt(String s) {
        int value = 0;
        int[] roman = new int[26];
        roman['I'-'A'] = 1;
        roman['V'-'A'] = 5;
        roman['X'-'A'] = 10;
        roman['L'-'A'] = 50;
        roman['C'-'A'] = 100;
        roman['D'-'A'] = 500;
        roman['M'-'A'] = 1000;
        char[] sa = s.toCharArray();
        for(int i=0; i<sa.length; i++) {
            if (i<sa.length-1) {
                if ((sa[i] == 'I' && sa[i+1] == 'V')
                || (sa[i] == 'I' && sa[i+1] == 'X')
                || (sa[i] == 'X' && sa[i+1] == 'L')
                || (sa[i] == 'X' && sa[i+1] == 'C')
                || (sa[i] == 'C' && sa[i+1] == 'D')
                || (sa[i] == 'C' && sa[i+1] == 'M')) {
                    value += roman[sa[i+1]-'A']-roman[sa[i]-'A'];
                    i ++;
                    continue;
                }
            }
            value += roman[sa[i]-'A'];
        }
        return value;
    }
}