zoukankan      html  css  js  c++  java
  • leetcode Two sum

    问题:Given an array of integers, find two numbers such that they add up to a specific target number.

    The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

    You may assume that each input would have exactly one solution.

    Input: numbers={2, 7, 11, 15}, target=9
    Output: index1=1, index2=2

    解决方法(java版)刚刚开始接触leetcode,写的算法效率可能不高,欢迎吐槽。

    public class Solution{
     public int[] twoSum(int [] numbers,int target){
      int[] array=new int[2];
      for(int i=0;i<numbers.length;i++){
       for(int j=i+1;j<numbers.length;j++){
        if(numbers[i]+numbers[j]==target){
         array[0]=i+1;
         array[1]=j+1;
        }
       }
      }
      return array;
     }
    }

  • 相关阅读:
    迷 宫
    车厢调度
    快速幂
    2804 最大最小数质因数
    3022 西天收费站
    2291 糖果堆
    1464 装箱问题 2
    Exists/In/Any/All/Contains操作符
    window.onscroll
    zIndex 属性设置元素的堆叠顺序。
  • 原文地址:https://www.cnblogs.com/zhaolizhen/p/leetcode.html
Copyright © 2011-2022 走看看