LeetCode-1. Two Sum

2019-05-29 17:20:12 浏览数 (1)

Problem

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

代码语言:javascript复制
Given nums = [2, 7, 11, 15], target = 9,

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

Answer

Thinking

Nothing

Code

代码语言:javascript复制
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    for(var i = 0; i < nums.length; i  ){
        for(var j = i   1; j < nums.length; j  ){
            if(nums[i]   nums[j] == target){
                return [i,j];
            }
        }
    }
};

0 人点赞