Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

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

Open
chencl1986 opened this issue Jul 23, 2020 · 0 comments

Comments

@chencl1986
Copy link
Owner

原题链接: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];
      }
    }
  }
};
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant