-
Notifications
You must be signed in to change notification settings - Fork 0
/
13.罗马数字转整数.js
65 lines (65 loc) · 1.32 KB
/
13.罗马数字转整数.js
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
/*
* @lc app=leetcode.cn id=13 lang=javascript
*
* [13] 罗马数字转整数
*/
/**
* @param {string} s
* @return {number}
*/
var romanToInt = function(s) {
const list = s.split('')
let sum = 0
let missIndex = -1
for (let [index, item] of list.entries()) {
if (index === missIndex) continue
switch (item) {
case 'I':
if (list[index + 1] === 'V') {
missIndex = index + 1
sum += 4
} else if (list[index + 1] === 'X') {
missIndex = index + 1
sum += 9
} else {
sum += 1
}
break
case 'X':
if (list[index + 1] === 'L') {
missIndex = index + 1
sum += 40
} else if (list[index + 1] === 'C') {
missIndex = index + 1
sum += 90
} else {
sum += 10
}
break
case 'C':
if (list[index + 1] === 'D') {
missIndex = index + 1
sum += 400
} else if (list[index + 1] === 'M') {
missIndex = index + 1
sum += 900
} else {
sum += 100
}
break
case 'V':
sum += 5
break
case 'L':
sum += 50
break
case 'D':
sum += 500
break
case 'M':
sum += 1000
break
}
}
return sum
}