two sum

最新推荐文章于 2024-04-07 20:30:43 发布

gsama

最新推荐文章于 2024-04-07 20:30:43 发布

阅读量454

点赞数

分类专栏： leetcode OJ

本文链接：https://blog.csdn.net/gsama/article/details/18916017

版权

leetcode OJ 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

一道leetcode里的高频面试题

题目：

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

方法一：两个for循环，O（n^2）

方法二：先sort，再从头和结尾分别向中间寻找 O(nlog n)。有一个问题在于sort后，index会变。查看别人的做法是：建一个Node class，将value和index保存下来，再按照value来mergeSort。

方法三：hashtable O（n）。

我试了解法三，虽然简单的题，还是各种出错。。。然后这个题目说了每个input会有exactly one solution，省了很多事。

import java.util.*;

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
  
        //by hashtable
		int[] ret = new int[2];
		int a=0;
		int b=0;
		int search = 0;
//        HashSet<Integer> ht = new HashSet<Integer>();
        Hashtable<Integer,Integer> ht = new Hashtable<Integer,Integer>();
        for(int i=0; i<numbers.length;i++){
        	if(!ht.containsKey(numbers[i])){
        	    search = target-numbers[i];
        		ht.put(search,i);
        	}
        	else{
        		//ret[0] = ht.get(numbers[i]);
        		//ret[1] = i+1;
   a= ht.get(numbers[i])+1;
   b=i+1;
        	}
        	
        }
        ret[0]=a;
        ret[1]=b;
       
      return ret;

    
    }
}