forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTwoSum.java
35 lines (32 loc) · 951 Bytes
/
TwoSum.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
package easy;
import java.util.HashMap;
import java.util.Map;
public class TwoSum {
public int[] twoSum_ON2(int[] nums, int target) {
int[] result = new int[2];
for(int i = 0; i < nums.length-1; i++){
for(int j = i+1; j < nums.length; j++){
if(nums[i] + nums[j] == target){
result[0] = i;
result[1] = j;
break;
}
}
}
return result;
}
public int[] twoSum_ON(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap();
int[] result = new int[2];
for(int i = 0; i < nums.length; i++){
if(map.containsKey(target-nums[i])){
result[0] = map.get(target-nums[i]);
result[1] = i;
break;
} else {
map.put(nums[i], i);
}
}
return result;
}
}