LeetCode-Two Sum

最新推荐文章于 2021-12-23 23:38:17 发布

disappearedgod

最新推荐文章于 2021-12-23 23:38:17 发布

阅读量581

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/disappearedgod/article/details/38462735

版权

LeetCode 专栏收录该内容

94 篇文章 0 订阅

订阅专栏

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/23621903

时间：2014-4-16

题目

Two Sum

Total Accepted: 27630 Total Submissions: 150279 My Submissions

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

解法

查看了一下还是用了Map，没有用排序的原因是担心时间。这里面有个唯一性（有唯一一对，并必有结果）

所以用索引比较快，并且没有存在太多的查询时间（Map瓶颈）。

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        Map<Integer,Integer> m = new HashMap<Integer,Integer>();
        int[] ret = new int[2];
        ret[0]=0;
        ret[1]=0;
        if(numbers.length < 2)
            return ret;
        int num1 = 0;
        int num2 = 0;
        for(int i = 0; i < numbers.length; i++){// num, i
            num1 = numbers[i];
            num2 = target-num1;
            if(m.containsKey(num2))
            {
                ret[0]=m.get(num2)+1;
                ret[1]=i+1;
                return ret;
            }
            else{
                m.put(num1,i);
            }
        }
        return ret;
    }
}