Leetcode - Roman to Integer

最新推荐文章于 2018-12-27 18:01:08 发布

free2o

最新推荐文章于 2018-12-27 18:01:08 发布

阅读量795

点赞数

分类专栏：算法和数据结构学习

本文链接：https://blog.csdn.net/free2o/article/details/52819161

版权

算法和数据结构学习专栏收录该内容

31 篇文章 1 订阅

订阅专栏

Given a roman numeral, convert it to an integer.

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

这个程序类似

int romanToInt(string s) {
    string symbols[] = { "M", "CM", "D", "CD" , "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" };
    int  nums[] = { 1000,900, 500, 400, 100, 90, 50, 40, 10, 9,  5, 4, 1 };
    int n = 0, offset = 0;

    for (int i = 0; i < sizeof(nums) / sizeof(nums[0]); i++)
    {
        while (!s.compare(offset, symbols[i].size(), symbols[i])) {
            offset += symbols[i].size();
            n += nums[i];
        }
    }

    return n;
}