leetcode1

day1:

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

给定一个整数数组，任意两个数相加使得其值=target。要求:一个解决方法，一个数不得使用两次；

第一种思路：循环暴力两个for循环使得nums[i]+nums[j]=target;时间复杂度O(N^2)

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

第二种思路：使用hashmap方法键值对，使得diff=target=nums[i],在找出diff即可O（n）

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