Skip to content

1. 两数之和 #31

Open
Open
@funnycoderstar

Description

@funnycoderstar

题目描述

给定一个整数数组和一个目标值,找出数组中和为目标值的两个数。
你可以假设每个输入只对应一种答案,且同样的元素不能被重复利用。

示例:

给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

解题方法

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function (nums, target) {
    var len = nums.length;
    var numObj = {};
    for (var i = 0; i < len; i++) {
        var current = nums[i];
        var match = target - current;
        if (match in numObj) {
            return [i, numObj[match]];
        } else {
            numObj[current] = i;
        }
    }
};

Metadata

Metadata

Assignees

No one assigned

    Labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions