-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathfirst_sum_of_pairs.rb
59 lines (53 loc) · 1.04 KB
/
first_sum_of_pairs.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
# return the first pair starting from left whose sum is equal to given number
# sum_pairs([10, 5, 2, 3, 7, 5], 10) => [3,7]
# ^-----------^
# ^--^ #[3,7] came earlier than [5,5]
def sum_pairs(ints, sum)
hash = {}
ints.each_with_index do |i,j|
if hash[i].nil?
hash[i]=[1,[j]]
else
hash[i][0]+=1
hash[i][1]<<j
end
end
# print hash
# puts ""
min=10000000000
tuple=nil
ints.each do |i|
if hash[sum-i].nil? || hash[i].nil?
next
elsif sum-i == i
if hash[i][0]>1 && min>hash[i][1][1]
min = hash[i][1][1]
tuple = [i,i]
hash[i]=nil
end
elsif min>hash[sum-i][1][0]
min = hash[sum-i][1][0]
tuple = [i,sum-i]
hash[i]=nil
hash[sum-i]=nil
else
hash[i]=nil
hash[sum-i]=nil
end
# print "#{min} #{tuple}\n"
end
tuple
end
print sum_pairs([1, 2, 3, 4, 1, 0], 2)
print sum_pairs([1, 2, 3, 4, 2, 5, 7, 6, 7], 9)
print sum_pairs([1, 2, 3, 4, 1, 4, 8, 9, 5], 8)
#
# def sum_pairs(ints, s)
# seen = {}
# for i in ints do
# return [s-i, i] if seen[s-i]
# seen[i] = true
# end
# nil
# end
#