2014-09-29 71 views
3

在我最近尝试的编码挑战中,我发现这是将数字转换为罗马数字的替代解决方案。我真的不明白这个代码是如何工作的。我只是想出了什么divmod但除此之外,我很困惑。Ruby中的罗马数字

class Integer 
    def to_roman 
    roman_arr = { 
     1000 => "M", 
     900 => "CM", 
     500 => "D", 
     400 => "CD", 
     100 => "C", 
     90 => "XC", 
     50 => "L", 
     40 => "XL", 
     10 => "X", 
     9 => "IX", 
     5 => "V", 
     4 => "IV", 
     1 => "I" 
    } 
    num = self 

    roman_arr.reduce("") do |res, (arab, roman)| 
     whole_part, num = num.divmod(arab) 
     res << roman * whole_part 
    end 
    end 
end 
+3

尝试把一些调试打印的循环。另外,你在找到这个之前是否实现了自己的解决方案?如果你认真思考并做到了这一点,那么这将是有道理的。 – 2014-09-29 04:28:57

+0

顺便说一句,尝试读这篇文章:http://tech.tulentsev.com/2014/02/kata-convert-numbers-to-roman-numerals/。循环部分是不同的,但有更多的解释。 :) – 2014-09-29 04:32:37

回答

6

reduce/fold是等同于命令式语言中循环结构的函数式编程。红宝石能够兼得。

foo.reduce("") { |a, i| a + i }相当于

a = "" 
foo.each {|i| a = a + i} 
a 

num = self的线将实例保存在本地变量以便可以在您传递减少块使用(其接收to_roman方法的数目)。

3

我在代码中添加了一些补充,希望现在清楚。 虽然你永远不会这样写,你发布的代码很好。

class Integer 

    def to_roman_explained 
    roman_arr = { 
     1000 => "M", 
     900 => "CM", 
     500 => "D", 
     400 => "CD", 
     100 => "C", 
     90 => "XC", 
     50 => "L", 
     40 => "XL", 
     10 => "X", 
     9 => "IX", 
     5 => "V", 
     4 => "IV", 
     1 => "I" 
    } 

    remaining = self # the integer on which this method is called 
    empty_string = "" # startvalue of result 

    return_value = roman_arr.inject(empty_string) do |result, (arab, roman)| 
     # inject = reduce, for each element of our hash 
     # arab and roman are the key and value part of the hash elements, result is result from previous iteration 
     p [result, arab, roman,remaining.divmod(arab)] # lets's see what happens 
     # number of times the remaining can be divided with the value of this roman, the remaining becomes the rest 
     whole_part, remaining = remaining.divmod(arab) 
     result << roman * whole_part # if whole_part == 0 nothing happens for this roman 
    end 

    return return_value 

    end 
end 

puts 555.to_roman_explained 

# gives 

# ["", 1000, "M", [0, 555]] 
# ["", 900, "CM", [0, 555]] 
# ["", 500, "D", [1, 55]] first time the integer is dividable by the value of the roman 
# ["D", 400, "CD", [0, 55]] our result now has the roman D 
# ["D", 100, "C", [0, 55]] 
# ["D", 90, "XC", [0, 55]] 
# ["D", 50, "L", [1, 5]] etc 
# ["DL", 40, "XL", [0, 5]] 
# ["DL", 10, "X", [0, 5]] 
# ["DL", 9, "IX", [0, 5]] 
# ["DL", 5, "V", [1, 0]] etc 
# ["DLV", 4, "IV", [0, 0]] 
# ["DLV", 1, "I", [0, 0]] 
# DLV 
1

我发现它比较容易,如果事先倒车数,如:

def new_roman(arabic_number) 
    symbols = {0=>["I","V"],1=>["X","L"],2=>["C","D"],3=>["M"]} 
    reversed_digits = arabic_number.to_s.split(//).reverse 
    romans =[] 
    reversed_digits.length.times do |i| 
    if reversed_digits[i].to_i< 4 
     romans<<(symbols[i][0]*reversed_digits[i].to_i) 
    elsif reversed_digits[i].to_i == 4 
     romans<<(symbols[i][0]+ symbols[i][1]) 
    elsif reversed_digits[i].to_i == 9 
     romans<<(symbols[i][0] + symbols[i+1][0]) 
    else 
     romans<<(symbols[i][1] + (symbols[i][0]*((reversed_digits[i].to_i)-5))) 
    end 
    end 
    romans.reverse.join("") 
end