1. Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

Subscribe to see which companies asked this question

1.直接O(n^2)

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int i=0;
        int j=0;
        boolean flag=false;
        while(i<nums.length-1){
            j=i+1;
            while(j<nums.length){
                if(nums[i]+nums[j]==target){
                    flag=true;
                    break;
                }
                else
                    j++;
                
            }
            if(flag)
                break;
            i++;    
        }
        return new int[]{i,j};
        
    }
}

2.使用HashMap

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer,Integer> re=new HashMap<Integer,Integer>();
        int i=0;
        re.put(nums[i],i);
        for(i=1;i<nums.length;++i){
            if(re.containsKey(target-nums[i]))
                break;
            else
                re.put(nums[i],i);
        }
        return new int[]{re.get(target-nums[i]),i};
        
    }
}