Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2025-01-15 03:43:22 +01:00
Code Issues Projects Releases Packages Wiki Activity

Add another brute force solution

Browse source
This commit is contained in:
Jessica Kwok 2021-03-11 09:20:26 -08:00
parent 6ed35ad29f
commit e58e707a57
1 changed files with 25 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
data_structures/arrays/two_sum.rb
View file

@ -26,7 +26,7 @@
# #
# Approach 1: Brute Force # Approach 1: Brute Force
# #
# Time Complexity: O(N^2) # Time Complexity: O(N^2), where N is the length of the array
# #
def two_sum(nums, target) def two_sum(nums, target)
result_array = [] result_array = []
@ -36,8 +36,7 @@ def two_sum(nums, target)
if i != j && i < j if i != j && i < j
current_sum = nums[i] + nums[j] current_sum = nums[i] + nums[j]
if current_sum == target if current_sum == target
result_array.push(i, j) return [i, j]
return result_array
end end
end end
end end
@ -50,3 +49,26 @@ print two_sum([3, 2, 4], 6)
# => [1,2] # => [1,2]
print two_sum([3, 3], 6) print two_sum([3, 3], 6)
# => [0,1] # => [0,1]
#
# Approach 2: Define and seek
#
# Time Complexity: O(N^2), where N is the length of the array
#
def two_sum(nums, target)
nums.each_with_index do |num, i|
target_difference = target - nums[i]
nums.each_with_index do |num, j|
if i != j && num == target_difference
return [i, j]
end
end
end
end
print two_sum([2, 7, 11, 15], 9)
# => [0,1]
print two_sum([3, 2, 4], 6)
# => [1,2]
print two_sum([3, 3], 6)
# => [0,1]