2018.7.21学习笔记

给定一个整数数组和一个目标值，找出数组中和为目标值的两个数。

你可以假设每个输入只对应一种答案，且同样的元素不能被重复利用。

给定 nums = [2, 7, 11, 15], target = 9

因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

方法一：暴力求解：时间复杂度O(n^2)，空间复杂度O(1)

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

方法二：哈希表法：时间复杂度O(n)，空间复杂度O(n)

class Solution 
{
    public int[] twoSum(int[] nums, int target)
    {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++)
        {
            int diff = target - nums[i];
            if (map.containsKey(diff))
                return new int[] {map.get(diff), i};
            map.put(nums[i], i);
        }
        return null;
    }
}