【LeetCode OJ】Roman to Integer
2014-06-09 00:00
288 查看
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
Input is guaranteed to be within the range from 1 to 3999.
public class Solution { public int romanToInt(String s) { char[] roman = { 'M', 'D', 'C', 'L', 'X', 'V', 'I' }; int[] integer = { 1000, 500, 100, 50, 10, 5, 1 }; int sum = 0; for (int i = 0; i < 7; ++i) { int m = s.indexOf(roman[i]); while (m >= 0) { if (m > 0) { int num = 0; if(i < 2) num = integer[2]; else if(i < 4) num = integer[4]; else if(i < 6) num = integer[6]; sum += integer[i] - num; } else if (m == 0) sum += integer[i]; s = s.substring(m + 1); m = s.indexOf(roman[i]); } } return sum; } }
相关文章推荐
- [LeetCode OJ]Roman to Integer
- LeetCode OJ-- Integer to Roman @
- LeetCode OJ:Integer to Roman(转换整数到罗马字符)
- Leetcode OJ 12 Integer to Roman [Medium]
- LeetCode OJ --问题与解答 Roman to Integer
- 四、[LeetCode OJ]Integer to Roman
- LeetCode OJ--Roman to Integer
- LeetCode OJ - Roman to Integer
- LeetCode OJ:Roman to Integer(转换罗马字符到整数)
- LeetCode OJ - Integer to Roman
- LeetCode OJ : Roman to Integer
- LeetCode OJ:Roman to Integer
- LeetCode OJ - Integer to Roman
- LeetCode OJ 之 Integer to Roman (整数转化为罗马数字)
- LeetCode OJ:Integer to Roman
- LeetCode OJ: 12 Integer to Roman
- LeetCode OJ - Roman to Integer
- LeetCode OJ 12. Integer to Roman
- Leetcode OJ 13 Roman to Integer [Easy]
- [LeetCode OJ]Integer to Roman