【LeetCode OJ】Roman to Integer
Given a roman numeral, convert it to an integer.java
Input is guaranteed to be within the range from 1 to 3999.code
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;
}
}
相關文章
- 1. leetcode--Integer to Roman
- 2. [leetcode]Integer to Roman
- 3. [leetcode] Integer to Roman
- 4. Roman To Integer --leetcode
- 5. leetcode--Roman to Integer
- 6. Integer to Roman -- LeetCode
- 7. 【leetcode】Roman to Integer
- 8. [LeetCode]Roman to Integer
- 9. [LeetCode]Integer to Roman
- 10. [leetcode] Roman to Integer
- 更多相關文章...
- • XPointer 實例 - XLink 和 XPointer 教程
- • ASP.NET Calendar SelectedDates 屬性 - ASP.NET 教程
- • 使用Rxjava計算圓周率
- • 算法總結-股票買賣
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. leetcode--Integer to Roman
- 2. [leetcode]Integer to Roman
- 3. [leetcode] Integer to Roman
- 4. Roman To Integer --leetcode
- 5. leetcode--Roman to Integer
- 6. Integer to Roman -- LeetCode
- 7. 【leetcode】Roman to Integer
- 8. [LeetCode]Roman to Integer
- 9. [LeetCode]Integer to Roman
- 10. [leetcode] Roman to Integer