问题
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, 2 is written as II in Roman numeral, just two one’s added together. 12 is written as XII, which is simply X + II. The number 27 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.
Example 1:
Input: s = “III”
Output: 3
Example 2:
Input: s = “IV”
Output: 4
Example 3:
Input: s = “IX”
Output: 9
Example 4:
Input: s = “LVIII”
Output: 58
Explanation: L = 50, V= 5, III = 3.
Example 5:
Input: s = “MCMXCIV”
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
Constraints:
- 1 <= s.length <= 15
- s contains only the characters (‘I’, ‘V’, ‘X’, ‘L’, ‘C’, ‘D’, ‘M’).
- It is guaranteed that s is a valid roman numeral in the range [1, 3999].
思考
和题目12差不多,只不过是从罗马数字的字符串转换为2进制数.
方法1
从左到右遍历字符串,如果左边的字符大于等于右边的字符,就加入直接加入结果.如果左边的小于右边的,则说明出现了4或者9, 需要做减法之后加入结果.
时间复杂度
O
(
n
2
)
O(n^{2})
O(n2).
空间复杂度
O
(
1
)
O(1)
O(1).
class Solution {
public static Map<Character, Integer> map = new HashMap<Character, Integer>();
static{
map.put('M',1000);
map.put('D',500);
map.put('C',100);
map.put('L',50);
map.put('X',10);
map.put('V',5);
map.put('I',1);
}
public int romanToInt(String s) {
int res = 0, pre = 0;
for(int i = 0,len = s.length(); i < len; i++){
int cur = map.get(s.charAt(i));
if(pre == 0){
pre = cur;
continue;
}
if(cur > pre){
res += (cur - pre);
pre = 0;
}else{
res += pre;
pre = cur;
}
}
return res + pre;
}
}