LeetCode: TWO SUM

//思路，使用map ，其key为(target-number)*number,value为number 

//每次读入一个number，先判断map中是否有key为(target-number)*number的键，若存在，则再判断，number+该key的value？=target

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] source = new int[numbers.length];
		for (int i = 0; i < numbers.length; i++) {
			 source[i] = numbers[i];
			 
		}
        int[] result = new int[2];
		Map<Integer,Integer> map = new HashMap<Integer,Integer>();
// 		Map<Integer,Integer> map = new LinkedHashMap<Integer,Integer>();
		for(int i=0;i<numbers.length;i++){
			int temp = (target - numbers[i])*numbers[i];
			if(map.containsKey(temp)&&(numbers[i]+map.get(temp)==target)){
				result[0] = map.get(temp);
				result[1] = numbers[i];
				break;
			}
			map.put(temp,numbers[i]);
		}
		int reslen = result.length;
		for (int i = 0; i < reslen; i++) {
			int j;
			if(i==0){
				j = 0;
				while(j<=numbers.length-1){
					if(result[i]==source[j]){
						result[i] = j+1;
						break;
					}
					j++;
				}
			}
			else {
				j = numbers.length-1;
				while(j>=0){
					if(result[i]==source[j]){
						result[i] = j+1;
						break;
					}
					j--;
				}
			}
		}
		if(result[0]>result[1]){
		    int temp = result[0];
		    result[0] = result[1];
		    result[1] = temp;
		}
		return result;
    }
    
}