LeetCode:Two Sum

最新推荐文章于 2019-01-03 13:40:30 发布

DamianGao

最新推荐文章于 2019-01-03 13:40:30 发布

阅读量202

点赞数

CC 4.0 BY-SA版权

分类专栏： JavaScript 文章标签： leetcode

本文链接：https://blog.csdn.net/ghr19961014/article/details/77834068

JavaScript 专栏收录该内容

12 篇文章

订阅专栏

本文介绍LeetCode经典题目“两数之和”的解决方案。给定整数数组及目标值，找出两个数相加等于目标值的下标。示例：输入数组[2,7,11,15]，目标值9；返回[0,1]。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode:Two Sum

Description

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, and you may not use the same element twice.

Example:

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

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

Code:

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
  var map={}
  for(var i=0;i<nums.length;i++){
    if(map[target-nums[i]]!==undefined){
      return [map[target-nums[i]],i]
    }
    map[nums[i]]=i;
  }
};