-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSumTwo.java
34 lines (30 loc) · 1.01 KB
/
SumTwo.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
import java.util.Arrays;
/*
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].
*/
public class SumTwo {
public static void main(String[] args) {
int[] nums={2,7,11,15};
int target=9;
int[] ans=twoSum(nums,target);
System.out.println(Arrays.toString(ans));
}
public static int[] twoSum(int[] nums, int target) {
int[] ans = {-1,-1};
for(int i=0; i<nums.length; i++){
for(int j=i+1; j<nums.length; j++){
if(nums[i]+nums[j]==target){
ans[0]=i;
ans[1]=j;
}
}
}
return ans;
}
}