Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2024-12-26 21:58:56 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

Sort plus comparing adjacent elements

Browse source
This commit is contained in:
Jessica Kwok 2021-03-09 14:49:05 -08:00
parent 90a35a8197
commit 47a8216712
1 changed files with 1 additions and 31 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

32
data_structures/arrays/find_all_duplicates_in_an_array.rb
View file

@ -55,34 +55,4 @@ Benchmark.bmbm do |x|
x.report('execute algorithm') do
print find_duplicates_2(long_array)
end
end
def find_duplicates_3(array)
result_hash = {}
result_array = []
# loop through array and build a hash with counters
# where the key is the array element and the counter is the value
# increase counter when duplicate is found
array.each do |num|
if result_hash[num].nil?
result_hash[num] = 1
else
result_hash[num] += 1
end
end
# loop through hash and look for values > 1
result_hash.each do |k, v|
if v > 1
result_array.push(k)
end
end
# return keys
result_array
end
require 'benchmark'
Benchmark.bmbm do |x|
x.report('execute algorithm') do
print find_duplicates_3(array)
end
end
end