### 1. Two Sum

• Total Accepted: 282086
• Total Submissions: 1088812
• 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):

public class Solution {
public int[] twoSum(int[] nums, int target) {
int[] a=new int[2];
for(int i=0;i<nums.length;i++){
for(int j=i+1;j<nums.length;j++){
if(nums[i]+nums[j]==target){
a[0]=i+1;
a[1]=j+1;
}
}
}
return a;
}
}

#### 1. Two Sum java

2018-01-30 16:38:28

#### HashTable-1-Two Sum

2018-01-22 19:42:45

#### 1.Two sum

2017-11-07 02:43:15

#### 1.Two Sum

2015-03-07 22:48:44

#### 1. Two Sum [easy] (Python)

2016-07-26 20:19:37

#### 1.Two Sum Leetcode Python

2015-01-27 01:04:51

#### 【leetcode】1.Two Sum

2016-02-29 22:34:01

#### 1.Two Sum(双指针的使用)

2016-04-10 09:29:31

#### [Leetcode] 1.Two Sum（unordered_map）

2017-11-20 11:19:39

#### leetcode 1.Two sum

2017-07-18 21:27:33

1.two sum