两数之和-leetcode

/*
 * @lc app=leetcode.cn id=1 lang=javascript
 *
 * [1] 两数之和
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
  let numsCopy = [...nums].sort((a, b) => a - b)
  let numsTarget = []
  numsCopy.every((v) => {
    if (numsCopy.includes(target - v)) {
      numsTarget = [v, target -v]
      return false
    }
    return true
  })
  numsTarget = numsTarget.map((v, i) => {
    return i ? nums.lastIndexOf(v) : nums.indexOf(v)
  })
  // console.log('numsTarget: ', numsTarget)
  return numsTarget
}

两数之和-leetcode

原文：https://www.cnblogs.com/coldfrost/p/11644029.html