-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOccurenceOfAnIntegerInALinkedList.java
71 lines (62 loc) · 1.42 KB
/
OccurenceOfAnIntegerInALinkedList.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
import java.util.*;
import java.lang.*;
class Node
{
int data;
Node next;
Node(int key)
{
data = key;
next = null;
}
}
class Occurrence
{
static Node head;
public static void main (String[] args) {
Scanner sc= new Scanner(System.in);
int t = sc.nextInt();
while(t-- > 0)
{
int n = sc.nextInt();
int a1 = sc.nextInt();
Node head = new Node(a1);
addToTheLast(head);
for(int i = 1; i < n; i++)
{
int a = sc.nextInt();
addToTheLast(new Node(a));
}
int k = sc.nextInt();
Solution ob= new Solution();
System.out.println(ob.count(head, k));
}
}
public static void addToTheLast(Node node)
{
if(head == null)
{
head = node;
}
else
{
Node temp = head;
while(temp.next != null)
temp = temp.next;
temp.next = node;
}
}
}
class Solution{
public static int count(Node head, int searchElement){
int count = 0;
Node iterator = head;
while(iterator != null){
if(iterator.data == searchElement){
count++;
}
iterator = iterator.next;
}
return count;
}
}