Leetcode: Roman to Integer

class Solution {
public:
    int romanToInt(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int result=0;
        int previous=1001;
        int current=0;
        for(int i=0;i<s.size();++i){
            current=map(s[i]);
            if(current<=previous)
                result+=current;
            else {
                result+=current;
                result-=2*previous;
                }
            previous=current;
            }
            
        return result;
        }           
    int map(char c){
        switch(c){
            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;
        }
    }
    
};