LeetCode-13.Roman to Integer

Posted 月半榨菜

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode-13.Roman to Integer相关的知识,希望对你有一定的参考价值。

Roman numerals are represented by seven different symbols: IVXLCD 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.
    public int romanToInt(String s) {
        if(s==null||0==s.length()){
            return 0;
        }
        HashMap<Character,Integer> map = new HashMap<Character,Integer>();
        map.put(‘I‘,1);
        map.put(‘V‘,5);
        map.put(‘X‘,10);
        map.put(‘L‘,50);
        map.put(‘C‘,100);
        map.put(‘D‘,500);
        map.put(‘M‘,1000);
        int re =0;
        int i=0;
        for(;i<s.length()-1;i++){
            char c = s.charAt(i);
            if(map.get(c)<map.get(s.charAt(i+1))){
                re-=map.get(c);
            }
            else{
                re+=map.get(c);
            }
        }
        re+=map.get(s.charAt(i));
        return re;
    }

 

以上是关于LeetCode-13.Roman to Integer的主要内容,如果未能解决你的问题,请参考以下文章

Leetcode 13. Roman to Integer(python)

leetcode13. Roman to Integer

[LeetCode][13]Roman to Integer解析 罗马字符转int类型关于栈的常数实现-Java实现

[LeetCode][13]Roman to Integer解析 罗马字符转int类型关于栈的常数实现-Java实现

6:Leetcode13:Roman to Integer笔记

LeetCode 13. Roman to Integer