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

Remove duplicated ThreeSum problem (fixes #4169) (#4170)

Browse Source
This commit is contained in:
Rutikpatil0123
2023-04-29 12:47:00 +05:30
committed by GitHub
parent 7ed65b0a1e
commit db9c78a598
1 changed files with 0 additions and 53 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
src/main/java/com/thealgorithms/others/ThreeSum.java
View File

@ -1,53 +0,0 @@
package com.thealgorithms.others;
import java.util.Arrays;
import java.util.Scanner;
/**
* To find triplet equals to given sum in complexity O(n*log(n))
*
* <p>
* Array must be sorted
*
* @author Ujjawal Joshi
* @date 2020.05.18
* <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];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
System.out.println("Target");
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--;
}
}
}
sc.close();
}
}