Two Sum @LeetCode

 
package Level2;  
  
import java.util.HashMap;  
import java.util.Hashtable;  
  
/** 
 * 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 
 */  
public class S1 {  
  
    public static void main(String[] args) {  
        Hashtable





 ht = new Hashtable();  
        System.out.println(ht.get(22));  
    }  
  
    public int[] twoSum(int[] numbers, int target) {  
        // 放值和数组下标  
        Hashtable ht = new Hashtable();  
        int[] ret = new int[2];  
          
        for(int i=0; i