[Leetcode] 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

Solution:

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] result = { -1, -1 };
        if (numbers.length < 2)
            return result;
        int[] copyNumbers = numbers.clone();
        Arrays.sort(copyNumbers);
        int low = 0;
        int high = copyNumbers.length - 1;
        int num1 = 0, num2 = 0;
        while (low < high) {
            int temp = copyNumbers[low] + copyNumbers[high];
            if (temp < target)
                low++;
            else if (temp > target)
                high--;
            else {
                num1 = copyNumbers[low];
                num2 = copyNumbers[high];
                break;
            }
        }
        for (int i = 0; i < numbers.length; ++i) {
            if (numbers[i] == num1 || numbers[i] == num2) {
                if (result[0] == -1)
                    result[0] = i + 1;
                else
                    result[1] = i + 1;
            }
        }
        return result;
    }
}

这里需要注意的是：

要返回的是index，所以得1.在复制后的copyNum里找到值，2. 在原num数组里通过值找到index。