leet Code刷题

1. Two Sum QuestionEditorial Solution My Submissions
   Total Accepted: 295545
   Total Submissions: 1117054
   Difficulty: Easy
   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.

package test;
import java.util.HashMap;
import java.util.Map;

public class test {
public static void main(String[] args){
test t = new test();
int nums[] = {2,7,15,8,12,1,2,-1,10};
// int nums[] = {2,7,11,15};
int target = 9;
// t.twoSum(nums, target);
Map