two sums

最新推荐文章于 2025-08-16 17:02:07 发布

weixin_33827731

最新推荐文章于 2025-08-16 17:02:07 发布

阅读量134

点赞数

CC 4.0 BY-SA版权

文章标签： python

原文链接：https://my.oschina.net/fengnote/blog/683529

2019独角兽企业重金招聘Python工程师标准>>>

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]. UPDATE (2016/2/13): The return format had been changed to zero-based indices. Please read the above updated description carefully.

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

转载于:https://my.oschina.net/fengnote/blog/683529