public int[] twoSum(int[] numbers, int target) {
	        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
	        int[] result = new int[2];
	        int n = numbers.length;
	        for(int i = 0; i< numbers.length; i++ ){
	        	
	        	if(map.containsKey(target-numbers[i])){
	        		result[0] = map.get(target-numbers[i]) +1;
	        		result[1] = i +1;
	        		
	        	}
	        	
	        	else{
	        		map.put(numbers[i],i);
	        	}
	        }

	    	return result;
	    }