LeetCode—two-sum—java

最新推荐文章于 2020-01-27 11:31:09 发布

Lynn_Baby

最新推荐文章于 2020-01-27 11:31:09 发布

阅读量292

点赞数

分类专栏：数组 Java HashMap LeetCode 牛客文章标签： HashMap 数组

本文链接：https://blog.csdn.net/Lynn_Baby/article/details/80574173

版权

Java 同时被 3 个专栏收录

138 篇文章 0 订阅

订阅专栏

牛客

138 篇文章 0 订阅

订阅专栏

LeetCode

82 篇文章 0 订阅

订阅专栏

题目描述：

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

思路解析：

利用HashMap，把target-numbers[i]的值放入hashmap中，value存index。遍历数组时，检查hashmap中是否已经存能和自己加一起等于target的值存在，存在的话把index取出，连同自己的index也出去，加1（index要求从1开始）后存入结果数组中返回。如果不存在的话，把自己的值和index存入hashmap中继续遍历。由于只是一遍遍历数组，时间复杂度为O(n)。

代码：

import java.util.HashMap;
public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] res = new int[2];
        if(numbers==null || numbers.length<2)
            return res;
        HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
        for(int i=0;i<numbers.length;i++){
            if(!map.containsKey(target-numbers[i])){
                map.put(numbers[i],i);
            }else{
                res[0]=map.get(target-numbers[i])+1;
                res[1]=i+1;
                break;
            }
        }
        return res;
    }
}

参考：https://www.cnblogs.com/springfor/p/3859618.html