[LeetCode] 13. Roman to Integer

Given a roman numeral, convert it to an integer.

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



class Solution {
    private int getThousands(String string){
        return string.length()*1000;
    }
    private int getHunderds(String string){
        switch (string){
            case "C": return 100;
            case "CC": return 200;
            case "CCC": return 300;
            case "CD": return 400;
            case "D": return 500;
            case "DC": return 600;
            case "DCC": return 700;
            case "DCCC": return 800;
            case "CM": return 900;
            default: return 0;
        }
    }
    private int getTens(String string){
        switch (string){
            case "X": return 10;
            case "XX": return 20;
            case "XXX": return 30;
            case "XL": return 40;
            case "L": return 50;
            case "LX": return 60;
            case "LXX": return 70;
            case "LXXX": return 80;
            case "XC": return 90;
            default: return 0;
        }
    }
    private int getOnes(String string){
        switch (string){
            case "I": return 1;
            case "II": return 2;
            case "III": return 3;
            case "IV": return 4;
            case "V": return 5;
            case "VI": return 6;
            case "VII": return 7;
            case "VIII": return 8;
            case "IX": return 9;
            default: return 0;
        }
    }
    public int romanToInt(String s) {
        int j = 0,i = 0,length = s.length();
        while (j < length && s.charAt(j) == 'M') j++;
        int thousands = getThousands(s.substring(i,j));
        i = j;
        while (j < length && (s.charAt(j) == 'C' || s.charAt(j) == 'D' || s.charAt(j) == 'M')) j++;
        int hunderds = getHunderds(s.substring(i,j));
        i = j;
        while (j < length && (s.charAt(j) == 'X' || s.charAt(j) == 'L' || s.charAt(j) == 'C')) j++;
        int tens = getTens(s.substring(i,j));
        int ones = getOnes(s.substring(j,length));
        return thousands + hunderds + tens + ones;
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值