leetcode/13.cpp at main · will-s-h/leetcode · GitHub

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
class Solution {
public:
    int oneChar(char c){
        if(c == 'I') return 1;
        if(c == 'V') return 5;
        if(c == 'X') return 10;
        if(c == 'L') return 50;
        if(c == 'C') return 100;
        if(c == 'D') return 500;
        return 1000;
    }

    int romanToInt(string s) {
        int i = 0;
        int total = 0;
        while(i < s.length()){
            if(i+1 < s.length()){
                bool sub = false;
                if(s[i] == 'I' && (s[i+1] == 'V' || s[i+1] == 'X')) sub = true;
                if(s[i] == 'X' && (s[i+1] == 'L' || s[i+1] == 'C')) sub = true;
                if(s[i] == 'C' && (s[i+1] == 'D' || s[i+1] == 'M')) sub = true;
                if(sub){
                    total += oneChar(s[i+1]) - oneChar(s[i]);
                    i += 2;
                    continue;
                }
            }
            total += oneChar(s[i]);
            i++;
        }

        return total;
    }
};