Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

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

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

Tags

Hash Table, Array

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function (nums, target) {
    var hash = [];
    var len = nums.length;
    var ret = [];

    for (var i = 0; i < len; i++) {
        if (nums[i] in hash) {
            ret.push(hash[nums[i]]);
            ret.push(i);
            break;
        } else {
            hash[target - nums[i]] = i;
        }
    }

    return ret;
};


發佈了82 篇原創文章 · 獲贊 0 · 訪問量 1萬+
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章