Solution to roman to integer conversion leetcode problem.

class Solution {
    public int romanToInt(String s) {
        Map<String, Integer> riMap = Map.of(
                "M", 1000, 
                "D",  500, 
                "C",  100, 
                "L",   50, 
                "X",   10, 
                "V",    5, 
                "I",    1);

        int sum = 0;
        int len = s.length();
        for (int ndx = 0; ndx < len - 1; ndx++) 
        {
            int cur = riMap.get(String.valueOf(s.charAt(ndx)));
            int nxt = riMap.get(String.valueOf(s.charAt(ndx + 1)));

            if (cur < nxt) {
                sum -= cur;
            } else {
                sum += cur;
            }       
        }

        sum += riMap.get(String.valueOf(s.charAt(len-1)));

        return sum;
    }
}