1 Two Sum

最新推荐文章于 2024-10-01 05:04:32 发布

luo-chuang

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量168

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/hardcum/article/details/50765736

版权

leetcode 专栏收录该内容

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

Example

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

代码块

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> arrayOfNumbers = new HashMap<Integer, Integer>();
        int result[] = new int[2];

        for (int i = 0; i < nums.length; i++) {
            arrayOfNumbers.put(nums[i], i);
        }

        for (int i = 0; i < nums.length; i++) {
            if (arrayOfNumbers.containsKey(target - nums[i])) {
                int index1 = i;
                int index2 = arrayOfNumbers.get(target - nums[i]);

                if(index1 == index2) continue;

                result[0] = index1;
                result[1] = index2;

                return result;
            }
        }
        return result;
    }
}