leetcode #13. Roman to Integer-优快云博客

本文链接：https://blog.youkuaiyun.com/zyp7355/article/details/104079244

本文介绍了一种将罗马数字转换为整数的方法，通过解析罗马数字的构成规则，利用哈希映射存储符号及其对应的数值，实现了从罗马数字到整数的有效转换。文章详细解释了特殊情况下的减法规则，并提供了一个示例代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

思路参考 respect

class Solution {
    public int romanToInt(String s) {
        if(s == null){
            return 0;
        }
        
        HashMap<Character,Integer> map = new HashMap<>();
        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 value = map.get(s.charAt(0));
        for(int i =1;i<s.length();i++){
            if(map.get(s.charAt(i)) > map.get(s.charAt(i-1))){
                value += map.get(s.charAt(i)) - map.get(s.charAt(i-1))*2;
                //如果前面一个数小于当前数 （如IV）因为前面已经+了一遍，所以减两次
            }
            else{
                value += map.get(s.charAt(i));
            }
        }
        
        return value;
    }
}