【LeetCode】13Roman to Integer

来源:互联网 发布:c语言数据类型怎么用 编辑:程序博客网 时间:2024/06/06 01:32

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;    }}
0 0
原创粉丝点击