Integer_To_Roman

// I=1(73)   V=5(86)   X=10(88)  L=50(76)  C=100(67)  D=500(68)  M=1000(77)
class Solution {
public:
    int romanToInt(string s) {
    short sum = 0, counter = s.length();
    for (char i = 0; i < counter ; ++i) {
        switch (s[i]) {
            case 73:{if(s[i+1]==86){sum+=4;++i;break;}
                     if(s[i+1]==88){sum+=9;++i;break;}
                     else{sum+=1;break;}}
            case 86:{sum+=5;break;}
            case 88:{if(s[i+1]==76){sum+=40;++i;break;}
                    if(s[i+1]==67){sum+=90;++i;break;}
                    else{sum+=10;break;}}
            case 76:{sum+=50;break;}
            case 67:{if(s[i+1]==68){sum+=400;++i;break;}
                    if(s[i+1]==77){sum+=900;++i;break;}
                    else{sum+=100;break;}}
            case 68:{sum+=500;break;}
            case 77:{sum+=1000;break;}
        }
    }
    return sum;
    }
};