LeetCode----1. Two Sum(Java实现)

问题描述：

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

解法一：（暴力破解）

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] s = new int[2];
        for (int i = 0; i < nums.length; ++i) {
            for(int j = i +1; j < nums.length; ++j) {
                if (nums[i] + nums[j] == target) {
                    s[0] = i;
                    s[1] = j;
         break;
                }
            }
        }
        return s;
    }
}

Runtime: 49 ms

解法二：(利用哈希)

class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> m = new HashMap<Integer, Integer>();
        int[] s = new int[2];
        for (int i = 0; i < nums.length; ++i) {
            if (m.containsKey(target - nums[i])) { //判断现存的HashMap中是否存在和当前值匹配的键值对
                s[0] = i;
                s[1] = m.get(target - nums[i]);
                break;
            }
            m.put(nums[i], i); //注意这里实际的数作为键，数组下标作为值存入
        }
        return s;
    }
}

Runtime: 7 ms