-
Notifications
You must be signed in to change notification settings - Fork 0
/
TwoSum.java
29 lines (23 loc) · 870 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
//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.
//Input: nums = [2,7,11,15], target = 9
//Output: [0,1]
//Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
class Solution {
public int[] twoSum(int[] nums, int target) {
int []newArray= new int[2];
for(int i=0;i<nums.length;i++)
{
for(int j=i+1;j<nums.length && j>=i;j++)
{
if(nums[i]+nums[j]==target)
{
newArray[0]=i;
newArray[1]=j;
}
}
}
return newArray;
}
}