#include "leetcode.h"

class Solution {
public:
  int romanToInt(string s) {
    int ans = 0, num = 0;
    for (int i = s.size() - 1; ~i; i--) {
      switch (s[i]) {
      case 'I':
        num = 1;
        break;
      case 'V':
        num = 5;
        break;
      case 'X':
        num = 10;
        break;
      case 'L':
        num = 50;
        break;
      case 'C':
        num = 100;
        break;
      case 'D':
        num = 500;
        break;
      case 'M':
        num = 1000;
        break;
      }
      if (4 * num < ans)
        ans -= num;
      else
        ans += num;
    }
    return ans;
  }
};

int main() {
  Solution obj;
  cout << obj.romanToInt("MCMXCIVMCMXCIV");
}