Skip to content

LeetCode题解:1. 两数之和,JavaScript,双循环暴力解法,详细注释 #107

Description

@chencl1986

原题链接:https://leetcode-cn.com/problems/two-sum/

解题思路:

  1. 双循环遍历,如果查找到两数之和为target,则返回结果。
  2. 注意第二层循环只要遍历第一层循环之后剩下的元素即可。
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
  for (let i = 0; i < nums.length - 1; i++) {
    // 遍历i之后的元素
    for (let j = i + 1; j < nums.length; j++) {
      // 如果两个元素之和为target,则返回结果
      if (nums[i] + nums[j] === target) {
        return [i, j];
      }
    }
  }
};

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions