算法入门|leetcode题解 NO.1 算法入门|leetcode

题目 Given an array of integers, return indices of the two numbers such that they add up to a specific target.
【算法入门|leetcode题解 NO.1】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].

题解

/** * @param {number[]} nums * @param {number} target * @return {number[]} */ var twoSum = function(nums, target) { var arr = []; nums.forEach(function(item, index){ var right = target-item; if(nums.indexOf(right)!==-1&&nums.indexOf(right)!==index){ arr[0] = index; arr[1] = nums.indexOf(right); } }) return arr; };