LeetCode 013 Roman to Integer

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_33765907/article/details/81508192

Roman numerals are represented by seven different symbols: IVXLCD and M.

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.

class Solution {
    public int romanToInt(String s) {
        HashMap<String, Integer> map = new HashMap<String, Integer>();
        map.put("I", new Integer(1));map.put("II", new Integer(2));map.put("III", new Integer(3));map.put("IV", new Integer(4));map.put("V", new Integer(5));map.put("VI", new Integer(6));map.put("VII", new Integer(7));map.put("VIII", new Integer(8));map.put("IX", new Integer(9));
        map.put("X", new Integer(10));map.put("XX", new Integer(20));map.put("XXX", new Integer(30));map.put("XL", new Integer(40));map.put("L", new Integer(50));map.put("LX", new Integer(60));map.put("LXX", new Integer(70));map.put("LXXX", new Integer(80));map.put("XC", new Integer(90));
        map.put("C", new Integer(100));map.put("CC", new Integer(200));map.put("CCC", new Integer(300));map.put("CD", new Integer(400));map.put("D", new Integer(500));map.put("DC", new Integer(600));map.put("DCC", new Integer(700));map.put("DCCC", new Integer(800));map.put("CM", new Integer(900));
        map.put("M", new Integer(1000));map.put("MM", new Integer(2000));map.put("MMM", new Integer(3000));

        int lens = s.length();
        int index = 0, sum = 0;
        while(index < lens) {
            if(index + 1 < lens && index + 2 < lens && index + 3 < lens) {
                if(map.containsKey(s.substring(index, index + 4))) {
                    sum = sum + map.get(s.substring(index, index + 4)).intValue();
                    index += 4;
                } else if(map.containsKey(s.substring(index, index + 3))) {
                    sum = sum + map.get(s.substring(index, index + 3)).intValue();
                    index += 3;
                } else if(map.containsKey(s.substring(index, index + 2))) {
                    sum = sum + map.get(s.substring(index, index + 2)).intValue();
                    index += 2;
                } else if (map.containsKey(s.substring(index, index + 1))) {
                    sum = sum + map.get(s.substring(index, index + 1)).intValue();
                    index += 1;
                }
            } else if(index + 1 < lens && index + 2 < lens) {
                if(map.containsKey(s.substring(index, index + 3))) {
                    sum = sum + map.get(s.substring(index, index + 3)).intValue();
                    index += 3;
                } else if(map.containsKey(s.substring(index, index + 2))) {
                    sum = sum + map.get(s.substring(index, index + 2)).intValue();
                    index += 2;
                } else if (map.containsKey(s.substring(index, index + 1))) {
                    sum = sum + map.get(s.substring(index, index + 1)).intValue();
                    index += 1;
                }
            } else if(index + 1 < lens) {
                if(map.containsKey(s.substring(index, index + 2))) {
                    sum = sum + map.get(s.substring(index, index + 2)).intValue();
                    index += 2;
                } else if (map.containsKey(s.substring(index, index + 1))) {
                    sum = sum + map.get(s.substring(index, index + 1)).intValue();
                    index += 1;
                }
            } else {
                if (map.containsKey(s.substring(index, index + 1))) {
                    sum = sum + map.get(s.substring(index, index + 1)).intValue();
                    index += 1;
                }
            }
        }
        return sum;
    }
}

猜你喜欢

转载自blog.csdn.net/qq_33765907/article/details/81508192