1. Two Sum

最新推荐文章于 2020-01-17 08:07:16 发布

onefanyf

最新推荐文章于 2020-01-17 08:07:16 发布

阅读量86

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/104013527

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

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

这道题是two sum，给

var twoSum = function(nums, target) {
    for(let i=0;i<nums.length;i++) {
        for(let j=i+1;j<nums.length;j++) {
            if(nums[i]+nums[j] === target) {
                return [i,j];
            }
        }
    }
};