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

    Tags; Array Hash Table

     1 import java.util.*;
     2 
     3 public class Solution {
     4     public int[] twoSum(int[] numbers, int target) {
     5         int[] index = new int[2];
     6         HashMap hm = new HashMap();
     7         int lens = numbers.length;
     8         for(int i=0; i<lens; i++){
     9             Integer j = (Integer)hm.get(target-numbers[i]);
    10             if(j != null){
    11                 index[0] = j+1;
    12                 index[1] = i+1;
    13                 return index;
    14             }
    15             hm.put(numbers[i], i);
    16         }
    17         return index;
    18     }
    19 }

    O(n2) runtime, O(1) space – Brute force:

    The brute force approach is simple. Loop through each element x and find if there is another value that equals to target – x. As finding another

    value requires looping through the rest of array, its runtime complexity is O(n2).

    O(n) runtime, O(n) space – Hash table:

    We could reduce the runtime complexity of looking up a value to O(1) using a hash map that maps a value to its index.

  • 相关阅读:
    操作技巧——电脑远程控制
    软件安装——internal error2503/2502
    系统常识——虚拟内存地址
    操作技巧——保障无线上网的技巧
    操作技巧——输入法转换问题
    软件安装——彻底卸载MySQL
    Java——this
    python百度贴吧爬虫
    糗事百科python爬虫
    python请求带cookie
  • 原文地址:https://www.cnblogs.com/iMirror/p/4409346.html
Copyright © 2011-2022 走看看