LeetCode1.两数之和twoSum（哈希表）

1、题目描述

2、代码详解

import java.util.HashMap;

public class TwoSum_1 {
    public static void main(String[] args){
        int[] nums = {2, 7, 11, 15};
        int target = 17;
        for (int s : twoSum(nums, target)){
            System.out.println(s);
        }


    }
    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 new int[]{-1, -1};

    }
}

Python解法 https://blog.csdn.net/IOT_victor/article/details/88196958

https://mp.weixin.qq.com/s/CKAK3WdhuZ5obCF-IbPg5g