Two Sum

最新推荐文章于 2022-02-05 12:19:14 发布

fanxian2

最新推荐文章于 2022-02-05 12:19:14 发布

阅读量237

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fanxian2/article/details/47263463

版权

leetcode 专栏收录该内容

9 篇文章 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

思路

该题可以通过枚举解决，遍历数组中的每个元素x，搜索target-x是否在该数组内，时间复杂度为 $O(n^2)$

因为时间主要浪费在搜索某个数值是否存在，所以可以引入hashtable来提高查询的效率

代码

import java.util.HashMap;
import java.util.Map;

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        Map<Integer,Integer> map = new HashMap<Integer,Integer>();

        for(int i=0; i<nums.length; i++){
            int tmp = target - nums[i];
            if(map.containsKey(tmp)){
                result[0] = map.get(tmp)+1;
                result[1] = i+1;
                break;
            }
            map.put(nums[i], i);
        }
        return result;
    }
}