-
Notifications
You must be signed in to change notification settings - Fork 0
/
ques4.java
121 lines (94 loc) · 3.15 KB
/
ques4.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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
import java.io.*;
import java.util.stream.*;
class SinglyLinkedListNode {
public int data;
public SinglyLinkedListNode next;
public SinglyLinkedListNode(int nodeData) {
this.data = nodeData;
this.next = null;
}
}
class SinglyLinkedList {
public SinglyLinkedListNode head;
public SinglyLinkedListNode tail;
public SinglyLinkedList() {
this.head = null;
this.tail = null;
}
public void insertNode(int nodeData) {
SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);
if (this.head == null) {
this.head = node;
} else {
this.tail.next = node;
}
this.tail = node;
}
}
class SinglyLinkedListPrintHelper {
public static void printList(SinglyLinkedListNode node, String sep, BufferedWriter bufferedWriter) throws IOException {
while (node != null) {
bufferedWriter.write(String.valueOf(node.data));
node = node.next;
if (node != null) {
bufferedWriter.write(sep);
}
}
}
}
class Result {
/*
* Complete the 'insertNodeAtPosition' function below.
*
* The function is expected to return an INTEGER_SINGLY_LINKED_LIST.
* The function accepts following parameters:
* 1. INTEGER_SINGLY_LINKED_LIST llist
* 2. INTEGER data
* 3. INTEGER position
*/
/*
* For your reference:
*
* SinglyLinkedListNode {
* int data;
* SinglyLinkedListNode next;
* }
*
*/
public static SinglyLinkedListNode insertNodeAtPosition(SinglyLinkedListNode llist, int data, int position) {
SinglyLinkedListNode newnode=new SinglyLinkedListNode(data);
SinglyLinkedListNode currnode=llist;
int n=0;
while(n<position-1){
currnode=currnode.next;
n++;
}
newnode.next=currnode.next;
currnode.next=newnode;
return llist;
// Write your code here
}
}
public class ques4 {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
SinglyLinkedList llist = new SinglyLinkedList();
int llistCount = Integer.parseInt(bufferedReader.readLine().trim());
IntStream.range(0, llistCount).forEach(i -> {
try {
int llistItem = Integer.parseInt(bufferedReader.readLine().trim());
llist.insertNode(llistItem);
} catch (IOException ex) {
throw new RuntimeException(ex);
}
});
int data = Integer.parseInt(bufferedReader.readLine().trim());
int position = Integer.parseInt(bufferedReader.readLine().trim());
SinglyLinkedListNode llist_head = Result.insertNodeAtPosition(llist.head, data, position);
SinglyLinkedListPrintHelper.printList(llist_head, " ", bufferedWriter);
bufferedWriter.newLine();
bufferedReader.close();
bufferedWriter.close();
}
}