-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path13.roman-to-integer.go
107 lines (104 loc) · 2.18 KB
/
13.roman-to-integer.go
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
/*
* @lc app=leetcode id=13 lang=golang
*
* [13] Roman to Integer
*
* https://leetcode.com/problems/roman-to-integer/description/
*
* algorithms
* Easy (51.68%)
* Total Accepted: 373.6K
* Total Submissions: 722.8K
* Testcase Example: '"III"'
*
* 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.
*
*/
func romanToInt(s string) int {
romanMap := map[string]int{
"I": 1,
"V": 5,
"X": 10,
"L": 50,
"C": 100,
"D": 500,
"M": 1000,
}
strLen := len(s)
lastIndex := strLen - 1
var sum int
for i := 0; i < lastIndex; i++ {
current := romanMap[string(s[i])]
next := romanMap[string(s[i+1])]
if current < next {
sum -= current
} else {
sum += current
}
}
sum += romanMap[string(s[lastIndex])]
return sum
}