题目描述
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 beforeV
(5) andX
(10) to make 4 and 9.X
can be placed beforeL
(50) andC
(100) to make 40 and 90.C
can be placed beforeD
(500) andM
(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.
解题思路
采用Map来存储每一个罗马数字对应的数值,由题意我们可以知道,当左边的罗马数字比右边的罗马数字小时,代表的数值为右边罗马数字减去左边的罗马数字,而当左边的罗马数字比右边的罗马数字大时则代表的数值为两个罗马数字相加。根据这个题意,我们就可以编写出相应的代码,只需逐个扫描字符串的每一个字符即可。
代码如下
class Solution {
public int romanToInt(String s) {
Map<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 sum = 0;
int preVal = 0;
for(int i=s.length()-1;i>=0;i--){
if(map.get(s.charAt(i)) >= preVal){
sum+=map.get(s.charAt(i));
} else {
sum-=map.get(s.charAt(i));
}
preVal = map.get(s.charAt(i));
}
return sum;
}
}