# No.001 Two Sum

### Two Sum

• Total Accepted: 262258
• Total Submissions: 1048169
• 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].

``` 1 public class Num1 {
2     public int[] twoSum(int[] nums, int target) {
3         int [] res = new int [2] ;
4         for(int i = 0 ; i < nums.length ; i++){
5             if(nums[i] > target){
6                 continue ;
7             }else{
8                 res[0] = i ;
9             }
10             for(int j = i+1 ; j < nums.length ; j++){
11                 if((nums[i]+nums[j]) == target){
12                     res[1] = j ;
13                     return res ;
14                 }else{
15                     continue ;
16                 }
17             }
18         }
19
20         return res ;
21     }
22 }```

138 篇文章50 人订阅

0 条评论

## 相关文章

2379

3596

### POJ--Strange Way to Express Integers

Strange Way to Express Integers Time Limit: 1000MS Memory Limit: 131072K ...

2817

### hdu 1829 A Bug's Life（分组并查集（偏移量））

A Bug's Life Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/3276...

3668

### 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐

1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐 Time Limit: 5 Sec  Memory Limit: 64 MB Subm...

3477

### 聊聊HystrixCommandExecutionHook

hystrix-core-1.5.12-sources.jar!/com/netflix/hystrix/strategy/executionhook/Hyst...

1262

### CodeForces Roads not only in Berland(并查集)

H - Roads not only in Berland Time Limit:2000MS     Memory Limit:262144KB    ...

2535

### HDOJ 1006

Tick and Tick Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/327...

2079

### HDUOJ---三角形(组合数学)

http://acm.hdu.edu.cn/showproblem.php?pid=1249 三角形 Time Limit: 2000/1000 MS (Ja...

3367

### 3713: [PA2014]Iloczyn

3713: [PA2014]Iloczyn Time Limit: 1 Sec  Memory Limit: 128 MB Submit: 327  Solve...

2385