-
Notifications
You must be signed in to change notification settings - Fork 25
/
Count_Triplets.java
76 lines (66 loc) · 1.41 KB
/
Count_Triplets.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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
import java.util.*;
class Node {
int data;
Node next;
Node(int a) {
data = a;
next = null;
}
}
class LinkedList {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t-- > 0) {
int n = sc.nextInt();
int x = sc.nextInt();
Node head = null;
for (int i = 0; i < n; i++) {
int a = sc.nextInt();
if (head == null) {
head = new Node(a);
} else
insert(head, a);
}
Solve y = new Solve();
System.out.println(y.countTriplets(head, x));
}
}
public static Node insert(Node head, int a) {
if (head == null) {
return new Node(a);
}
head.next = insert(head.next, a);
return head;
}
}
class Solve {
static int countTriplets(Node head, int x) {
// Convert linkedList to arraylist
ArrayList<Integer> list = new ArrayList<>();
while (head != null) {
list.add(head.data);
head = head.next;
}
Collections.sort(list);
int n = list.size();
int count = 0;
for (int i = 0; i < n - 2; i++) {
int j = i + 1;
int k = n - 1;
while (j < k) {
int sum = list.get(i) + list.get(j) + list.get(k);
if (sum == x) {
count++;
j++;
k--;
} else if (sum > x) {
k--;
} else {
j++;
}
}
}
return count;
}
}