题目描述
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.
GoLang 语法:switch 语句
switch var1 {
case val1:
...
case val2:
...
default:
...
}
- 变量
var1
可以是任何类型,而val1
和val2
则可以是同类型的任意值。类型不被局限于常量或整数,但必须是相同的类型 switch
语句执行的过程从上至下,直到找到匹配项,匹配项后面也不需要再加break
,匹配成功后就不会执行其他case
- 如果我们需要执行后面的
case
,可以使用fallthrough
AC 代码
func s2I(ch byte) int {
var val int = 0
switch ch {
case 'I': val = 1
case 'V': val = 5
case 'X': val = 10
case 'L': val = 50
case 'C': val = 100
case 'D': val = 500
case 'M': val = 1000
}
return val
}
func romanToInt(s string) int {
var ans int = 0
var max int = 1
for i := len(s)-1; i >= 0; i-- {
cur := s2I(s[i])
if cur >= max {
max = cur
ans += cur
} else if cur < max {
ans -= cur
}
}
return ans
}