zoukankan      html  css  js  c++  java
  • 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

    思路: 这题没啥思路~仔细读题!不用binary search

     1     public int[] twoSum(int[] numbers, int target) {
     2         int[] res = {-1, -1};
     3         if (numbers == null || numbers.length < 2) {
     4             return res;
     5         }
     6         HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
     7         for (int i = 0; i < numbers.length; i++) {
     8             int val = target - numbers[i];
     9             if (map.containsKey(val)) {
    10                 return new int[] {map.get(val) + 1 , i + 1};
    11             }else{
    12                 map.put(numbers[i], i);
    13             }
    14         }
    15         return res;
    16     }
  • 相关阅读:
    对象
    函数3
    函数2-作用域
    事件的分类
    函数1
    简单了解JSON Web令牌(JWT)
    Pycharm激活码,2020年9月29日最新激活码
    Python基础学习之常用模块
    python详细图像仿射变换讲解
    Python如何快速复制序列?
  • 原文地址:https://www.cnblogs.com/gonuts/p/4647999.html
Copyright © 2011-2022 走看看