leetcode - 13.Roman to Integer

最新推荐文章于 2022-05-05 16:31:36 发布

xiedacon

最新推荐文章于 2022-05-05 16:31:36 发布

阅读量146

点赞数

分类专栏： leetcode题集文章标签： leetcode

本文链接：https://blog.csdn.net/qq_27350929/article/details/59635236

版权

leetcode题集专栏收录该内容

96 篇文章 0 订阅

订阅专栏

Roman to Integer

Given a roman numeral, convert it to an integer.

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

Solution:

  public int romanToInt(String s) {
        char[] chars = s.toCharArray();
        int result = 0;

        for (int i = chars.length - 1; i >= 0; i--) {
            switch (chars[i]) {
            case 'I':
                result += (result >= 5 ? -1 : 1);
                break;
            case 'V':
                result += 5;
                break;
            case 'X':
                result += (result >= 50 ? -10 : 10);
                break;
            case 'L':
                result += 50;
                break;
            case 'C':
                result += (result >= 500 ? -100 : 100);
                break;
            case 'D':
                result += 500;
                break;
            case 'M':
                result += 1000;
                break;
            }
        }

        return result;
    }