zoukankan      html  css  js  c++  java
  • 基于js的数据结构与算法-数组


    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.

    Given nums = [2, 7, 11, 15], target = 9,
    
    Because nums[0] + nums[1] = 2 + 7 = 9,
    return [0, 1].

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

          return [i,j];

          }
        }
        }
     };

  • 相关阅读:
    IO流
    泛型类
    自动打包&解包:auto-boxing&unboxing
    Map接口
    如何选择数据结构
    Compareable接口
    List常用算法
    equals和==
    List接口
    set接口
  • 原文地址:https://www.cnblogs.com/data-structure/p/9458804.html
Copyright © 2011-2022 走看看