【LeetCode】13 Roman to Integer

最新推荐文章于 2020-07-24 09:26:10 发布

正努力学English的程序猿

最新推荐文章于 2020-07-24 09:26:10 发布

阅读量240

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/yuanzexi/article/details/50128495

版权

LeetCode 专栏收录该内容

29 篇文章 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) {
        char[] arrs = s.toCharArray();
        Integer sum = 0;
        for(int i = 0; i < arrs.length; i++){
            switch (arrs[i]){
                case 'I':
                    if(i < arrs.length - 1){
                        if(arrs[i+1] == 'V'){
                            sum += 4;
                            i++;    
                        }else if(arrs[i+1] == 'X'){
                            sum += 9;
                            i++;
                        }else{
                            sum += 1;   
                        }
                    }else{
                        sum += 1;   
                    }
                    break;

                case 'V':
                    sum += 5;
                    break;

                case 'X':
                    if(i < arrs.length - 1){
                        if(arrs[i+1] == 'L'){
                            sum += 40;
                            i++;    
                        }else if(arrs[i+1] == 'C'){
                            sum += 90;
                            i++;
                        }else{
                            sum += 10;   
                        }
                    }else{
                        sum += 10;   
                    }
                    break;

                case 'L':
                    sum += 50;
                    break;

                case 'C':
                    if(i < arrs.length - 1){
                        if(arrs[i+1] == 'D'){
                            sum += 400;
                            i++;    
                        }else if(arrs[i+1] == 'M'){
                            sum += 900;
                            i++;
                        }else{
                            sum += 100;   
                        }
                    }else{
                        sum += 100;   
                    }
                    break;

                 case 'D':
                    sum += 500;
                    break;

                 case 'M':
                    sum += 1000;
                    break;
            }

        }

        return sum;
    }
}