leetcode解题方案--001--TwoSum

最新推荐文章于 2019-06-19 19:49:50 发布

笔筒谜语

最新推荐文章于 2019-06-19 19:49:50 发布

阅读量235

点赞数

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

本文链接：https://blog.csdn.net/sinat_16014143/article/details/77894119

版权

leetcode 专栏收录该内容

85 篇文章 0 订阅

订阅专栏

题目

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

代码块

public static int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target-nums[i])) {
                return new int[]{map.get(target-nums[i]),i};
            } else {
                map.put(nums[i], i);
            }
        }
        return null;
    }