[leetcode] 13. Roman to Integer

原创 2016年06月01日 12:13:02

Given a roman numeral, convert it to an integer.

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

any of the letters representing numbers in the Roman numerical system: I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1,000. In this system, a letter placed after another of greater value adds (thus XVI or xvi is 16), whereas a letter placed before another of greater value subtracts (thus XC or xc is 90).

Solution 1:

Idea: use switch flow. If current val is smaller than next val, minus current val. (36ms for 3999 cases)

class Solution {
public:
    int romanToInt(string s) {
        int num_digit = s.size();
        int ret = 0;
        int cur = 0, aft = 0;
        for(int i = 0; i<num_digit-1; i++){
            cur = characterToInt(s[i]);
            aft = characterToInt(s[i+1]);
            if (cur < aft) 
                ret -= cur;
            else
                ret += cur;
        }
        ret += characterToInt(s[num_digit-1]);
        return ret;
        
    }
    int characterToInt(char c){
        int val;
        switch (c){
            case 'I':
                val= 1;
                break;
            case 'V':
                val= 5;
                break;
            case 'X':
                val= 10;
                break;
            case 'L':
                val= 50;
                break;
            case 'C':
                val= 100;
                break;
            case 'D':
                val= 500;
                break;
            case 'M':
                val= 1000;
        }
        return val;
    }
};


Solution 2

Idea: use hash table (72ms for 3999 cases)

class Solution {
public:
    int romanToInt(string s) {
        unordered_map<char,int> hs;
        hs['M'] = 1000;
        hs['D'] = 500;
        hs['C'] = 100;
        hs['L'] = 50;
        hs['X'] = 10;
        hs['V'] = 5;
        hs['I'] = 1;
        
        int ret= 0;
        for(int i=0; i<s.size()-1;i++){
            int val = hs[s[i]];
            int aft = hs[s[i+1]];
            if(val<aft)
                ret-= val;
            else
                ret+= val;
        }
        ret+= hs[s[s.size()-1]];
        return ret;
        
    }
};



版权声明:本文为博主原创文章,未经博主允许不得转载。

(Java)LeetCode-13. Roman to Integer

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from ...
  • u012848330
  • u012848330
  • 2016年05月10日 23:27
  • 322

【leetcode c++】13 Roman to Integer

题目 Given a roman numeral, convert it to aninteger. Input is guaranteed to be within the rangefrom 1 ...
  • hqq39
  • hqq39
  • 2015年06月12日 12:36
  • 515

LeetCode(13) RomanToInteger

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 t...
  • feliciafay
  • feliciafay
  • 2013年12月11日 10:42
  • 2691

[LeetCode][13]Roman to Integer解析 罗马字符转int类型关于栈的常数实现-Java实现

Q: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range...
  • u014629433
  • u014629433
  • 2016年06月14日 10:36
  • 1680

13. Roman to Integer [easy] (Python)

题目链接https://leetcode.com/problems/roman-to-integer/题目原文 Given a roman numeral, convert it to an in...
  • coder_orz
  • coder_orz
  • 2016年05月18日 23:01
  • 1636

[leetcode]Roman to Integer C语言

【题目】 Roman to Integer Given a roman numeral, convert it to an integer. Input is guaranteed to be w...
  • noc_lemontree
  • noc_lemontree
  • 2015年08月20日 09:49
  • 624

Integer to Roman (罗马数字转换) 【leetcode】

题目:Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range fr...
  • zhang9801050
  • zhang9801050
  • 2013年09月20日 16:09
  • 16628

LeetCode13——Roman to Integer

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from ...
  • booirror
  • booirror
  • 2015年01月27日 17:51
  • 2457

LeetCode --- 12. Integer to Roman

题目链接:Integer to Roman Given an integer, convert it to a roman numeral. Input is guaranteed to be w...
  • makuiyu
  • makuiyu
  • 2015年01月29日 10:49
  • 1962

【LeetCode】Integer to Roman 和 Roman to Integer 解题报告

【题目】 Given a roman numeral, convert it to an integer. Or, Given an integer, convert it to a roman nu...
  • ljiabin
  • ljiabin
  • 2014年10月10日 20:28
  • 21633
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode] 13. Roman to Integer
举报原因:
原因补充:

(最多只允许输入30个字)