欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页

LeetCode 1 Two Sum (hash)

程序员文章站 2022-07-15 14:23:12
...

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

题目链接:https://leetcode.com/problems/two-sum/

2ms,时间击败99.62%

class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> mp = new HashMap<>();
        int x = 0, y = 0;
        for (int i = 0; i < nums.length; i++) {
            int tmp = target - nums[i];
            if (mp.containsKey(tmp)) {
                x = mp.get(tmp);
                y = i;
                break;
            }
            mp.put(nums[i], i);
        }
        return new int[] {x, y};
    }
}

 

相关标签: hash