-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathDay58.java
More file actions
53 lines (43 loc) · 1.82 KB
/
Day58.java
File metadata and controls
53 lines (43 loc) · 1.82 KB
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
import java.util.*;
public class Day58 {
public static List<List<Integer>> findQuadruplets(int[] nums, int target) {
List<List<Integer>> quadruplets = new ArrayList<>();
Arrays.sort(nums);
int n = nums.length;
for (int i = 0; i < n - 3; i++) {
if (i > 0 && nums[i] == nums[i - 1]) continue; // Skip duplicates
for (int j = i + 1; j < n - 2; j++) {
if (j > i + 1 && nums[j] == nums[j - 1]) continue; // Skip duplicates
int left = j + 1;
int right = n - 1;
while (left < right) {
int sum = nums[i] + nums[j] + nums[left] + nums[right];
if (sum == target) {
quadruplets.add(Arrays.asList(nums[i], nums[j], nums[left], nums[right]));
// Skip duplicates
while (left < right && nums[left] == nums[left + 1]) left++;
while (left < right && nums[right] == nums[right - 1]) right--;
left++;
right--;
} else if (sum < target) {
left++;
} else {
right--;
}
}
}
}
return quadruplets;
}
public static void main(String[] args) {
int[] nums1 = {1, 2, 1, 0, 1};
int target1 = 5;
System.out.println("Sample Input 1: " + findQuadruplets(nums1, target1).size());
int[] nums2 = {2, 2, 2, 2, 1, 3};
int target2 = 8;
System.out.println("Sample Input 2: " + findQuadruplets(nums2, target2).size());
int[] nums3 = {1, 1, 1, 0};
int target3 = 4;
System.out.println("Sample Input 3: " + findQuadruplets(nums3, target3).size());
}
}