-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram58.java
More file actions
94 lines (64 loc) · 2.09 KB
/
program58.java
File metadata and controls
94 lines (64 loc) · 2.09 KB
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
/*
1. Two Sum
Easy
46.1K
1.5K
Companies
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
*/
package LeetCode;
import java.util.Arrays;
import java.util.HashMap;
public class program58 {
static int[] twoSum(int[] nums, int target) {
int[] ans = new int[2];
ans[0] = ans[1] = -1;
HashMap<Integer, Integer> mpp = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int val = target - nums[i];
if (mpp.containsKey(val)) {
ans[0] = mpp.get(val);
ans[1] = i;
return ans;
}
mpp.put(nums[i], i);
}
return ans;
// Arrays.sort(nums);
// int left = 0;
// int right = nums.length-1;
// while(left<right){
// if(nums[left]+nums[right]<target){
// left++;
// }
// if(nums[left]+nums[right]>target){
// right--;
// }
// if(nums[left]+nums[right]==target){
// System.out.println("Found"+nums[left]+" "+nums[right]);
// break;
// }
// }
// return ans;
}
public static void main(String args[]) {
int[] nums = { 3,2,4,8,12,43};
int target = 14;
int[] a = twoSum(nums, target);
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
}
}
}