码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode 13 Roman to Integer

时间:2015-07-05 21:03:40      阅读:94      评论:0      收藏:0      [点我收藏+]

标签:

Given a roman numeral, convert it to an integer.

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

如果左边字母的值小于右边,则减去左边的,防止溢出,最后一个值一定需要加上去

def roman_to_int(s)
    h = {"I" => 1,"V" => 5, "X" => 10, "L" => 50, "C" => 100, "D" => 500, "M" => 1000}
    sum = 0
    (s.length-1).times do |i|
      if h[s[i]]< h[s[i+1]]
        sum -= h[s[i]]
      else
        sum += h[s[i]]
      end
    end
    sum += h[s[-1]]
end

 

Leetcode 13 Roman to Integer

标签:

原文地址:http://www.cnblogs.com/lilixu/p/4622876.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!