Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
52 lines (48 loc) · 1.33 KB

File metadata and controls

52 lines (48 loc) · 1.33 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package leetcode._13_;
import java.util.Arrays;
import java.util.List;
/**
* Created by zhangbo54 on 2019-03-04.
*/
public class Main2 {
public static void main(String[] args) {
Solution solution = new Solution();
System.out.println(solution.romanToInt("LVIII"));
// Integer.parseInt("1" + Integer.MAX_VALUE);
}
static
class Solution {
public int romanToInt(String s) {
int result = 0;
for (int i = 0; i < s.length(); i++) {
int cur = getInt(s.charAt(i));
if (i + 1 < s.length() && getInt(s.charAt(i + 1)) > getInt(s.charAt(i))) {
result -= cur;
} else {
result += cur;
}
}
return result;
}
private int getInt(char ch) {
switch (ch) {
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:
return 0;
}
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.