1. Two Sum Ruby

最新推荐文章于 2020-10-18 15:51:16 发布

原创最新推荐文章于 2020-10-18 15:51:16 发布 · 1.6k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #ruby

leetcode 专栏收录该内容

166 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的有效算法。给定一个整数数组及目标值，该算法能快速找到两个数的下标，使得这两个数相加等于目标值。文章通过使用哈希表的方法，确保了算法的高效性。

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

def two_sum(nums, target)
    search = Hash.new
    nums.each_with_index do |item, index|
        i = search[target - item]
        return [i + 1, index + 1] if i != nil
        search[item] = index
    end
end