LeetCode #13 Roman to Integer

2018-10-03  本文已影响0人  光煜Gray

思路

用一个池子pool积蓄累计值
从左往右看,如果当前的数字:

  1. 比右边的数字大, 那么就可以把pool清空并把里面的值加到result
  2. 比右边的数字小,那么可以把pool清空并把里面的值从result里减去
  3. 与右边的数字一样大,把当前数值积蓄到pool
class Solution {
    public int romanToInt(String s) {
        int result = 0;
        int pool = 0;
        for(int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            //右边没有更多的字母了
            if (i == s.length() - 1) {
                result = result + pool + romanSymbolToInt(c);
                break;
            }
            
            int currentInt = romanSymbolToInt(c);
            pool += currentInt;
            int nextInt = romanSymbolToInt(s.charAt(i+1));
            if (currentInt < nextInt) {
                result -= pool;
                pool = 0;
            } else if (currentInt > nextInt) {
                result += pool;
                pool = 0;
            }
        }
        return result;
    }
    
    private int romanSymbolToInt(char c) {
        switch(c) {
            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;
        }
        return 0;
    }
}
上一篇 下一篇

猜你喜欢

热点阅读