-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path13. Roman to Integer (Hashtable + Math) 20.2.3 Easy
More file actions
130 lines (114 loc) · 4.2 KB
/
13. Roman to Integer (Hashtable + Math) 20.2.3 Easy
File metadata and controls
130 lines (114 loc) · 4.2 KB
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
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.
Solution no.1: -------------------------------------------------------------- HashTable
-------------------------------------------------- O(n^2) worst T for replace() in Python, O(k) S
class Solution(object):
def romanToInt(self,s):
translation = { # We must set it as "I": 1, instead of 1: "I",
# because we would like to call dic[key] to obtain the value later
"I" : 1,
"V" : 5,
"X" : 10,
"L" : 50,
"C" : 100,
"D" : 500,
"M" : 1000
}
number = 0
s = s.replace("IV", "IIII") # string.replace() will replace all satisfied old pieces with new pieces,
# however, replace() do not modify the original string
# so, we must do the direct assignment here to modify the original string
s = s.replace("IX", "VIIII")
s = s.replace("XL", "XXXX")
s = s.replace("XC", "LXXXX")
s = s.replace("CD", "CCCC")
s = s.replace("CM", "DCCCC")
for w in s:
number += translation[w]
return number
Solution no.2: -------------------------------------------------------- A much more efficient way
----------------------------------------------- O(n) T, O(1) S
class Solution(object):
def romanToInt(self, s):
"""
:type s: str
:rtype: int
"""
if not s:
return 0
res = 0
for i in range(len(s) - 1, -1, -1):
c = s[i]
if c == 'I':
res += 1 if res < 5 else -1 # For case "IV", "IX"
elif c == 'V':
res += 5
elif c == 'X':
res += 10 if res < 50 else -10 # For case "XL", "XC"
elif c == 'L':
res += 50
elif c == 'C':
res += 100 if res < 500 else -100 # For case "CD", "CM"
elif c == 'D':
res += 500
elif c == 'M':
res += 1000
return res
Java Version:
class Solution {
public int romanToInt(String s) {
int res = 0;
for (int i = s.length() - 1; i >= 0; i --) {
if (s.charAt(i) == 'I') {
res += (res < 5 ? 1 : -1);
} else if (s.charAt(i) == 'V') {
res += 5;
} else if (s.charAt(i) == 'X') {
res += (res < 50 ? 10 : -10);
} else if (s.charAt(i) == 'L') {
res += 50;
} else if (s.charAt(i) == 'C') {
res += (res < 500 ? 100 : -100);
} else if (s.charAt(i) == 'D') {
res += 500;
} else {
res += 1000;
}
}
return res;
}
}