leetcode-#13. Roman to Integer

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/roman-to-integer
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

python3

class Solution:
    def romanToInt(self, x: str) -> int:
        dict = {
        'I': 1,
        'V': 5,
        'X': 10,
        'L': 50,
        'C': 100,
        'D': 500,
        'M': 1000,
        }
        num = 0
        length = len(x)
        i = 0

        while (i < length):
            if (i+1) < length:
                if dict[x[i+1]] > dict[x[i]]:
                    num += dict[x[i+1]] - dict[x[i]]
                    i += 2
                else:
                    num += dict[x[i]]
                    i += 1
            else:
                num += dict[x[i]]
                i += 1
        return num

C implementation

int read(char a){
    switch (a){
        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:  printf("Input Error!\n");
                  return 0;
    }
}

int romantoint(char *s){
    int len = 0;
    int pos = 0;
    int sum = 0;
    int next = 0;
    for(len = 0;s[len]!='\0';len++);
    while(pos != len){
        printf("pos:%d\n",pos);
        if(s[pos+1] != '\0'){
            if(read(s[pos+1])>read(s[pos])){
                next = read(s[pos+1])-read(s[pos]);
                pos += 2;
                sum += next;
                continue;
            }
        }
        next = read(s[pos]);
        pos ++;
        sum += next;
    }
    return sum;
}



作者：wangha
链接：https://leetcode-cn.com/problems/roman-to-integer/solution/4ms-7mb-ckuai-su-jie-ti-by-wangha/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。