leetcode-13-roman to integer

class Solution {
public:
    int romanToInt(string s) {
        int len = s.size();
        int num=0;
        for(int i=0;i<len;i++){
            if(s[i] == 'I' && (s[i+1] == 'V' || s[i+1] == 'X')){
                if(s[i+1] == 'V'){
                    num += 4;
                    i++;
                }
                else if(s[i+1] == 'X'){
                    num += 9;
                    i++;
                }
            }
            else if(s[i] == 'X' && (s[i+1] == 'L' || s[i+1] == 'C')){
                if(s[i+1] == 'L'){
                    num += 40;
                    i++;
                }
                else if(s[i+1] == 'C'){
                    num += 90;
                    i++;
                }
            }
            else if(s[i] == 'C' && (s[i+1] == 'D' || s[i+1] == 'M')){
                if(s[i+1] == 'D'){
                    num += 400;
                    i++;
                }
                else if(s[i+1] == 'M'){
                    num += 900;
                    i++;
                }
            }
            else if(s[i]=='I')
                num += 1;
            else if(s[i]=='V')
                num += 5;
            else if(s[i]=='X')
                num += 10;
            else if(s[i]=='L')
                num += 50;
            else if(s[i]=='C')
                num += 100;
            else if(s[i]=='D')
                num += 500;
            else
                num += 1000;
        }
        return num;
    }
};