mirror of
https://github.com/TheAlgorithms/Ruby
synced 2025-01-14 08:01:05 +01:00
52 lines
No EOL
1.2 KiB
Ruby
52 lines
No EOL
1.2 KiB
Ruby
# Challenge name: Two Sum
|
|
# Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
|
|
#
|
|
# You may assume that each input would have exactly one solution, and you may not use the same element twice.
|
|
#
|
|
# You can return the answer in any order.
|
|
#
|
|
#
|
|
# Examples
|
|
#
|
|
# Input: nums = [2, 7, 11, 15], target = 9
|
|
# Output: [0,1]
|
|
# Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
|
|
#
|
|
# Input: nums = [3, 2, 4], target = 6
|
|
# Output: [1,2]
|
|
#
|
|
# Input: nums = [3, 3], target = 6
|
|
# Output: [0,1]
|
|
# Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
|
|
#
|
|
# @param {Integer[]} nums
|
|
# @param {Integer} target
|
|
# @return {Integer[]}
|
|
|
|
#
|
|
# Approach 1: Brute Force
|
|
#
|
|
# Time Complexity: O(N^2)
|
|
#
|
|
def two_sum(nums, target)
|
|
result_array = []
|
|
|
|
nums.each_with_index do |num, i|
|
|
nums.each_with_index do |num, j|
|
|
if i != j && i < j
|
|
current_sum = nums[i] + nums[j]
|
|
if current_sum == target
|
|
result_array.push(i, j)
|
|
return result_array
|
|
end
|
|
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] |