1.two sum

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].

import java.util.HashMap;

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int [] result=new int[2];
        HashMap <Integer,Integer> m=new HashMap<Integer,Integer>();
        for(int i=0;i<nums.length;i++)
        {
            m.put(nums[i],i);
        }
        
        for(int j=0;j<nums.length;j++)
        {
            int key=target-nums[j];
            if(m.containsKey(key)&&m.get(key)!=j)
            {
                result[0]=m.get(key);
                result[1]=j;
            }
        }
        return result;
    }
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/xhjj520/article/details/80317900
个人分类: leedcode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

1.two sum

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭