Created
July 29, 2009 21:06
-
-
Save mattmanning/158397 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Project Euler #18 using recursion | |
T = DATA.readlines("\n").map {|x| x.split(' ').map {|i| i.to_i}} | |
# one-liner | |
#def max_sum(r,i) T[r+1] ? [T[r][i] + max_sum((r+1),i), T[r][i] + max_sum((r+1),(i+1))].max : T[r][i] end; puts max_sum(0,0) | |
def max_sum(row,item) | |
if T[row+1] | |
[ T[row][item] + max_sum((row+1),item), | |
T[row][item] + max_sum((row+1),(item+1))].max | |
else | |
T[row][item] | |
end | |
end | |
puts max_sum(0,0) | |
__END__ | |
75 | |
95 64 | |
17 47 82 | |
18 35 87 10 | |
20 04 82 47 65 | |
19 01 23 75 03 34 | |
88 02 77 73 07 63 67 | |
99 65 04 28 06 16 70 92 | |
41 41 26 56 83 40 80 70 33 | |
41 48 72 33 47 32 37 16 94 29 | |
53 71 44 65 25 43 91 52 97 51 14 | |
70 11 33 28 77 73 17 78 39 68 17 57 | |
91 71 52 38 17 14 91 43 58 50 27 29 48 | |
63 66 04 68 89 53 67 30 73 16 69 87 40 31 | |
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment