题目:
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.
方法:
map存储字母和数字的映射关系
将当前的数字与前面的数字比较,如果小于等于前面的数字,则加上这个数字 否则之前加错了,应该减掉两倍前面的数字
例如:“LVIII” 当前的数字一直比之前的数字小,一直加即可
例如:“IV” 刚开始加1,然后发现当前数字5大于之前的数字1,所以之前加1加错了,应该减1,所以应该减去2倍的1,得到4
c++:
c++ 初始化map unordered_map<char, int> m = {{‘I’, 1}, {‘V’, 5}, {‘X’, 10}, {‘L’, 50}, {‘C’, 100}, {‘D’, 500}, {‘M’, 1000}};
class Solution {
public:
int romanToInt(string s) {
int res = 0;
unordered_map<char, int> m = {{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}};
for(int i = 0; i < s.size(); i++){
if(i == 0 || m[s[i]] <= m[s[i - 1]]) res += m[s[i]];
else res += (m[s[i]] - 2 * m[s[i - 1]]);
}
return res;
}
};
java:
java中map不能直接初始化
class Solution {
private static final Map<Character, Integer> maps = new HashMap<>();
static{
maps.put('I', 1);
maps.put('V', 5);
maps.put('X', 10);
maps.put('L', 50);
maps.put('C', 100);
maps.put('D', 500);
maps.put('M', 1000);
}
public int romanToInt(String s) {
int res = 0;
for(int i = 0; i < s.length(); i++){
if(i == 0 || maps.get(s.charAt(i)) <= maps.get(s.charAt(i - 1))) res += maps.get(s.charAt(i));
else res += (maps.get(s.charAt(i)) - 2 * maps.get(s.charAt(i - 1)));
}
return res;
}
}
python:
python 初始化map m = {‘I’ : 1, ‘V’: 5, ‘X’: 10, ‘L’: 50, ‘C’: 100, ‘D’: 500, ‘M’: 1000}
class Solution(object):
def romanToInt(self, s):
"""
:type s: str
:rtype: int
"""
res = 0
m = {'I' : 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
for i in range(len(s)):
if i == 0 or m[s[i]] <= m[s[i - 1]]: res += m[s[i]]
else: res += (m[s[i]] - 2 * m[s[i - 1]])
return res