LeetCode #1Two 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].

  

 

answer:

var twoSum = function(nums, target) {
        var len=nums.length;
        for(var i=0;i<len;i++){
            for(var j=len-1;j>i;j--){
                if(nums[i]+nums[j]==target){
                    return [i,j];
                }
            }
        }
    };
    console.log(twoSum([2, 7, 11, 15],9));

  

posted on 2016-09-07 16:17  carlyin  阅读(94)  评论(0)    收藏  举报

导航