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

    Have you met this question in a real interview?
     
    Analysis:
    Be carefull: the return indexs are not zero-based! Means that the position 0 should return 1.
     
    Solution:
     1 public class Solution {
     2     public int[] twoSum(int[] numbers, int target) {
     3         int[] res = new int[2];
     4         Map<Integer,Integer> map = new HashMap<Integer,Integer>();
     5         for (int i=0;i<numbers.length;i++)
     6             if (map.containsKey(target-numbers[i])){
     7                 res[0] = map.get(target-numbers[i]);
     8                 res[1] = i+1;
     9                 break;
    10             } else {
    11                 map.put(numbers[i],i+1);
    12             }
    13 
    14         return res;
    15     }
    16 }
  • 相关阅读:
    跑路了
    *CTF 2019 quicksort、babyshell、upxofcpp
    pyspark如何遍历broadcast
    pwn易忘操作原理笔记
    pwn学习之四
    pwn学习之三
    pwn学习之二
    pwn学习之一
    2017GCTF部分writeup
    OD使用教程12
  • 原文地址:https://www.cnblogs.com/lishiblog/p/4127589.html
Copyright © 2011-2022 走看看