leetcode 13. Roman to Integer

class Solution { public: int romanToInt(string s) { int ans = 0; for(int i = 0;i < s.length(); i++){ if(i < s.length() - 1){ if(s[i] == 'C' && (s[i+1] == 'D' || s[i+1] == 'M')){ ans -= 100; continue; } else if(s[i] == 'X' && (s[i+1] == 'L' || s[i+1] == 'C')){ ans -= 10; continue; } else if(s[i] == 'I' && (s[i+1] == 'V' || s[i+1] == 'X')){ ans -= 1; continue; } } if(s[i] == 'M') ans+=1000; else if(s[i] == 'D') ans += 500; else if(s[i] == 'C') ans += 100; else if(s[i] == 'L') ans += 50; else if(s[i] == 'X') ans += 10; else if(s[i] == 'V') ans += 5; else if(s[i] == 'I') ans += 1; } return ans; } };