LintCode 56. 两数之和

给一个整数数组，找到两个数使得他们的和等于一个给定的数 target。

你需要实现的函数twoSum需要返回这两个数的下标, 并且第一个下标小于第二个下标。注意这里下标的范围是 0 到 n-1。

public class Solution {
   /**
    * @param numbers: An array of Integer
    * @param target: target = numbers[index1] + numbers[index2]
    * @return: [index1 + 1, index2 + 1] (index1 < index2)
    */
   public int[] twoSum(int[] numbers, int target) {
      // write your code here
      if (numbers == null || numbers.length == 0) {
         return null;
      }
      Map<Integer, Integer> map = new HashMap<>();
      for (int i = 0; i < numbers.length; i++) {
         if (map.get(numbers[i]) == null) {
            map.put(numbers[i], 1);
         } else {
            map.put(numbers[i], map.get(numbers[i]) + 1);
         }
      }
      int[] result = new int[2];
      for (int i = 0; i < numbers.length; i++) {
         int another = target - numbers[i];
         if (numbers[i] != another && map.get(another) != null || numbers[i] == another && map.get(another) > 1) {
            result[0] = i;
            for (int j = i + 1; j < numbers.length; j++) {
               if (numbers[j] == another) {
                  result[1] = j;
                  break;
               }
            }
            break;
         }
      }
      return result;
   }
}