48 lines
856 B
Java
48 lines
856 B
Java
|
package Others;
|
||
|
|
|
||
|
|
import java.util.Scanner;
|
||
|
|
import java.util.Arrays;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* To find triplet equals to given sum in complexity O(n*log(n))
|
||
|
|
*
|
||
|
|
*
|
||
|
|
* Array must be sorted
|
||
|
|
*
|
||
|
|
* @author Ujjawal Joshi
|
||
|
|
* @date 2020.05.18
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
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];
|
||
|
|
|
||
|
|
for(int i=0;i<n;i++)
|
||
|
|
{
|
||
|
|
a[i]=sc.nextInt();
|
||
|
|
}
|
||
|
|
System.out.println("Number to be find");
|
||
|
|
int n_find=sc.nextInt();
|
||
|
|
|
||
|
|
Arrays.sort(a); // Sort the array if array is not sorted
|
||
|
|
|
||
|
|
for(int i=0;i<n;i++){
|
||
|
|
|
||
|
|
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--;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
}
|
||
|
|
}
|