【leetcode】1. Two Sum【简单】

最新推荐文章于 2022-03-19 12:53:02 发布

听雨眠_sun

最新推荐文章于 2022-03-19 12:53:02 发布

阅读量99

点赞数

分类专栏：算法相关文章标签： leetcode

本文链接：https://blog.csdn.net/baidu_31492511/article/details/107698515

版权

算法相关专栏收录该内容

47 篇文章 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].

My answer:

class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer,Integer> map = new HashMap<Integer,Integer>();
        int[] ans =new int[2];
        for(int i=0 ;i < nums.length ; i++){
            int another = target - nums[i];
            if(map.containsKey(another)){
               ans[0]= i;
               ans[1]= map.get(another);
                return ans;
            }
            map.put(nums[i],i);
        }   
        return null;
    }
}