Problem
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:
Ican be placed beforeV(5) andX(10) to make 4 and 9.Xcan be placed beforeL(50) andC(100) to make 40 and 90.Ccan 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: C = 100, L = 50, XXX = 30 and III = 3.
Example 5:
Input: "MCMXCIV" Output: 1994 Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
Solution
accumulate the value of each letter.
If the value of current letter is greater than the previous one, deduct twice of the previous value.
e.g. IX, 1 + 10 – 2 * 1 = 9 instead of 1 + 10 = 11
Time complexity: O(n)
Space complexity: O(1)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// Author: Huahua class Solution { public: int romanToInt(string s) { map<char, int> m{{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}}; int ans = 0; for (int i = 0; i < s.length(); i++) { ans += m[s[i]]; if (i > 0 && m[s[i]] > m[s[i - 1]]) ans -= 2 * m[s[i - 1]]; } return ans; } }; |
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
// Author: Huahua class Solution { private int v(char R) { switch (R) { case 'I' : return 1; case 'V' : return 5; case 'X' : return 10; case 'L' : return 50; case 'C' : return 100; case 'D' : return 500; case 'M' : return 1000; default: break; } return 0; } public int romanToInt(String s) { int ans = 0; for (int i = 0; i < s.length(); i++) { ans += v(s.charAt(i)); if ( i > 0 && v(s.charAt(i)) > v(s.charAt(i - 1))) ans -= 2 * v(s.charAt(i - 1)); } return ans; } } |
Python3
|
1 2 3 4 5 6 7 8 9 |
class Solution: def romanToInt(self, s): m = {'I' : 1, 'V': 5, 'X': 10, 'L' : 50, 'C' : 100, 'D': 500, 'M': 1000} ans = m[s[0]] for c, p in zip(s[1:], s[0:-1]): ans += m[c] if m[c] > m[p]: ans -= 2 * m[p] return ans |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment