leetcode Roman to integer

class Solution {
public:
    int romanToInt(string s) {
        int output = 0;
        int val,val_1;
        int size = s.size();
        for (int i = 0; i < s.size(); i++){
            val = fun(s[i]);
            val_1 = fun(s[i+1]);
            if (val < val_1){
                output = val_1-val + output;
                i++;
            }
            else{
                output = output + val;
            }
        }
        return output;
    }
    int fun(char a){
                switch (a) {
                case 'I':   return 1;
                case 'V':   return 5;
                case 'X':   return 10;
                case 'L':   return 50;
                case 'C':   return 100;
                case 'D':   return 500;
                case 'M':   return 1000;
                default:    return 0;
            }
    }
};