Two Sum

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

这个题目经常网上面试题中可以看到，但是如果想要通过OJ 特别需要注意一些特殊的测试案例。

题意说了肯定会有一组而且只有一组解，所以不要去担心无解的情况。 需要特别注意就是出现重复元素情况。如：[0 , 1, 2, 0] ,target = 0

则输出要是 index1=1, index2=4 所以在进行查找时需要进行标记，某个位置使用了就不能再选择啦！

package Two_Sum;

import java.util.Arrays;

public class Solution {
	public int[] twoSum(int[] numbers, int target) {
		int len = numbers.length;
		//只需要拷贝numbers 中数据，copy = numbers 表明copy 指向同一引用
		int[] copy = Arrays.copyOf(numbers, len);
		Arrays.sort(numbers);
		int[] ans = new int[2];
		for (int i = 0, j = len - 1; i < len && j >= i;) {
			if (numbers[i] + numbers[j] == target) {
				ans[0] = findPlace(numbers[i], copy, -1);
				ans[1] = findPlace(numbers[j], copy, ans[0] - 1);
				break;
			} else if (numbers[i] + numbers[j] > target) {
				j--;
			} else {
				i++;
			}
		}
		//调整最终坐标的位置。
		if (ans[0] > ans[1]) {
			int temp = ans[0];
			ans[0] = ans[1];
			ans[1] = temp;
		}
		return ans;
	}

	public int findPlace(int val, int[] num, int oPlace) {
		int place = 0;
		for (int i = 0; i < num.length; i++) {
			if (num[i] == val && i != oPlace) {
				place = i;
				break;
			}
		}
		return place + 1;
	}

	public static void main(String[] args) {
		int[] num = { 2,3,4,5,7,9,21,34,23};
		int target = 9;
		Solution s = new Solution();
		int[] ans = s.twoSum(num, target);
		System.out.println(ans[0]);
		System.out.println(ans[1]);
	}
}