[Leetcode] 13. Roman to Integer

最新推荐文章于 2023-10-30 12:20:17 发布

MatthrewX

最新推荐文章于 2023-10-30 12:20:17 发布

阅读量352

点赞数

分类专栏： Leetcode Java 文章标签： Leetcode Math String

本文链接：https://blog.csdn.net/u013897903/article/details/44227705

版权

Leetcode 同时被 2 个专栏收录

143 篇文章 1 订阅

订阅专栏

Java

22 篇文章 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) {
        if(s == null || s.length() == 0) return 0;
        int num = 0;
        for(int i = 0; i < s.length(); i++){
            switch(s.charAt(i)){
                case 'M':
                    num += 1000;
                    break;
                case 'D':
                    num += 500;
                    break;
                case 'C':
                    if(i < s.length() - 1 && (s.charAt(i + 1) == 'M' || s.charAt(i + 1) == 'D')){
                        num -= 100;
                    } else {
                        num += 100;
                    }
                    break;
                case 'L':
                    num += 50;
                    break;
                case 'X':
                    if(i < s.length() - 1 && (s.charAt(i + 1) == 'L' || s.charAt(i + 1) == 'C')){
                        num -= 10;
                    } else {
                        num += 10;
                    }
                    break;
                case 'V':
                    num += 5;
                    break;
                case 'I':
                    if(i < s.length() - 1 && (s.charAt(i + 1) == 'X' || s.charAt(i + 1) == 'V')){
                        num -= 1;
                    } else {
                        num += 1;
                    }
                    break;
                default:
                    num += 0;
            }
        }
        return num;
    }
}