algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 14:34:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

71
Others/ThreeSum.java
View File

@ -1,60 +1,47 @@
package Others;
import java.util.Scanner;
import java.util.Arrays;
import java.util.Scanner;
/**
* To find triplet equals to given sum in complexity O(n*log(n))
*
*
* Array must be sorted
* <p>Array must be sorted
*
* @author Ujjawal Joshi
* @date 2020.05.18
*
* Test Cases:
Input:
* 6 //Length of array
12 3 4 1 6 9
target=24
* Output:3 9 12
* Explanation: There is a triplet (12, 3 and 9) present
in the array whose sum is 24.
*
*
* <p>Test Cases: Input: 6 //Length of array 12 3 4 1 6 9 target=24 Output:3 9 12 Explanation:
* There is a triplet (12, 3 and 9) present in the array whose sum is 24.
*/
class ThreeSum {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); // Length of an array
int a[] = new int[n];
class ThreeSum{
public static void main(String args[])
{
Scanner sc =new Scanner(System.in);
int n=sc.nextInt(); //Length of an array
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
System.out.println("Target");
int n_find = sc.nextInt();
int a[]=new int[n];
Arrays.sort(a); // Sort the array if array is not sorted
for(int i=0;i<n;i++)
{
a[i]=sc.nextInt();
}
System.out.println("Target");
int n_find=sc.nextInt();
for (int i = 0; i < n; i++) {
Arrays.sort(a); // Sort the array if array is not sorted
int l = i + 1, r = n - 1;
for(int i=0;i<n;i++){
while (l < r) {
if (a[i] + a[l] + a[r] == n_find) {
System.out.println(a[i] + " " + a[l] + " " + a[r]);
break;
} // if you want all the triplets write l++;r--; insted of break;
else if (a[i] + a[l] + a[r] < n_find) l++;
else r--;
}
}
int l=i+1,r=n-1;
while(l<r){
if(a[i]+a[l]+a[r]==n_find) {System.out.println(a[i]+" "+ a[l]+" "+a[r]);break;} //if you want all the triplets write l++;r--; insted of break;
else if(a[i]+a[l]+a[r]<n_find) l++;
else r--;
}
}
sc.close();
}
}
sc.close();
}
}