【LeetCode】 013. Roman to Integer

LSF_Kevin

于 2016-07-28 21:24:18 发布

阅读量164

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_31129455/article/details/52059272

版权

LeetCode 专栏收录该内容

217 篇文章 0 订阅

订阅专栏

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

public class Solution {
    public int romanToInt(String s) {
        int sum = 0;
        for (int i = 0; i < s.length(); i++) {
            switch (s.charAt(i)) {
            case 'M': 
                sum += 1000;
                break;
            case 'D':
                sum += 500;
                break;
            case 'C':
                sum += 100;
                break;
            case 'L':
                sum += 50;
                break;
            case 'X':
                sum += 10;
                break;
            case 'V':
                sum += 5;
                break;
            case 'I':
                sum += 1;
                break;
            }
        }
        if (s.contains("IV")) {
            sum -= 2;
        }
        if (s.contains("IX")) {
            sum -= 2;
        }
        if (s.contains("XL")) {
            sum -= 20;
        }
        if (s.contains("XC")) {
            sum -= 20;
        }
        if (s.contains("CD")) {
            sum -= 200;
        }
        if (s.contains("CM")) {
            sum -= 200;
        }
        return sum;
    }
}