Leetcode1

186 阅读 0 评论 123 点赞

我是靠谱客的博主耍酷星月，这篇文章主要介绍Leetcode1，现在分享给大家，希望可以做个参考。

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

class Solution {

    public int[] twoSum2(int[] numbers, int target) {
         //返回int类型的数组
        int[] result = new int[2];
         //声明map
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < numbers.length; i++) {
            if (map.containsKey(target - numbers[i])) {
                result[1] = i ;
                result[0] = map.get(target - numbers[i]);
                return result;
            }
            map.put(numbers[i], i );
        }
        return result;
    }
}