Skip to content

Latest commit

 

History

History
29 lines (23 loc) · 473 Bytes

008.两数之和.md

File metadata and controls

29 lines (23 loc) · 473 Bytes

两数之和

LeetCode

https://leetcode-cn.com/problems/two-sum/

难度:简单

解答

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
   var obj = {};

  for(var i=0; i< nums.length;i++) {
    const item = nums[i];
    if(obj[item] >= 0) {
      return [obj[item], i]
    } else {
      obj[target - item] = i;
    }
  }
};