1、TwoSum

Leetcode第一题：TwoSum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

以下的解决方案中，有些是自己写的，有些是看的别人的，有些是Leetcode给的solution。

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

/**
 * 给定一个整数数组，找到两个数，使得它们的和等于一个特定的目标数。
 * 函数twoSum应返回两个数的索引（index），使它们加起来等于目标，其中索引1必须小于索引2。注意返回的答案（包括索引1和索引2 ）不是从零开始的。
 * 可以假设每个输入有且仅有一个答案。 输入：数字 = {2,7,11,15}，目标 = 9 输出：索引1 = 1，索引2 = 2
 */
public class Test1 {
	public static void main(String[] args) {
		int[] array = new int[] { 11, 7, 2, 15 };
		int target = 9;
		int[] result = new int[2];
		result = twoSum(array, target);
		System.out.println("Index1 = " + (result[0]+1) + " Index2 = " + (result[1]+1));
	}

	// private static void TwoSum(int[] array,int target) {
	// for (int i = 0; i < array.length; i++) {
	// for (int j = 0; j < array.length; j++) {
	// if (array[i] + array[j] == target) {
	// if (i <= j) {
	// System.out.println("Index1 = " + (i+1) + ",Index2 = " + (j+1));
	// }else {
	// System.out.println("Index1 = " + (j+1) + ",Index2 = " + (i+1));
	// }
	// }
	// }
	// }
	// }

//	private static int[] TwoSum(int[] array, int target) {
//		int[] a = array.clone();
//		Arrays.sort(a);
//
//		int length = a.length;
//		int left = 0;
//		int right = length - 1;
//		int sum = 0;
//
//		ArrayList<Integer> list = new ArrayList<Integer>();
//		while (left < right) {
//			sum = a[left] + a[right];
//			if (sum == target) {
//
//				for (int i = 0; i < length; ++i) {
//					if (array[i] == a[left]) {
//						list.add(i + 1);
//					} else if (array[i] == a[right]) {
//						list.add(i + 1);
//					} 
//					if (list.size() == 2) {
//						break;
//					}
//				}
//				break;
//			} else if (sum < target) {
//				++left;
//			} else {
//				--right;
//			}
//
//		}
//
//		int[] result = new int[2];
//		result[0] = list.get(0);
//		result[1] = list.get(1);
//		return result;
//	}
	
//	private static 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[j] == target - nums[i]) {
//					return new int[]{i,j};
//				}
//			}
//		}
//		throw new IllegalArgumentException("No two sum solution");
//	} 
	
//	private static int[] twoSum(int[] nums,int target){
//		Map<Integer, Integer> map = new HashMap<Integer,Integer>();
//		for (int i = 0; i < nums.length; i++) {
//			map.put(nums[i], i);
//		}
//		for (int i = 0; i < nums.length; i++) {
//			int complement = target - nums[i];
//			if (map.containsKey(complement) && map.get(complement) != i) {
//				return new int[]{i,map.get(complement)};
//			}
//		}
//		throw new IllegalArgumentException("No two sum solution");
//	}
	
	private static int[] twoSum(int[] nums,int target){
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int i = 0; i < nums.length; i++) {
			int complement = target - nums[i];
			if (map.containsKey(complement)) {//如果包含complement的key存在
				return new int[]{map.get(complement),i};
			}
			map.put(nums[i], i);
		}
		throw new IllegalArgumentException("No two sum solution");
	}

}