首页 > itarticle > LeetCode-Two Sum

LeetCode-Two Sum

admin 11月 12, 2020 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.

解题思路

把target-nums[i]作为key值放入hashmap
遍历数组检查hashmap中是否已经存在相加等一target值
存在取出
不存在将自己存入hashmap继续遍历

代码

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