-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPrintElementsLinkedList.java
More file actions
91 lines (67 loc) · 2.07 KB
/
Copy pathPrintElementsLinkedList.java
File metadata and controls
91 lines (67 loc) · 2.07 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
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
package com.HackerRank;
import java.util.Scanner;
public class PrintElementsLinkedList {
/*
* Hacker Rank Algorithm Question - Print the Elements of a Linked List Solution
*
* Solved Date : 2019-09-13
* Author : TK Lee
*
* Source : https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list/problem
*/
static class SinglyLinkedListNode {
public int data;
public SinglyLinkedListNode next;
public SinglyLinkedListNode(int nodeData) {
this.data = nodeData;
this.next = null;
}
}
static 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;
}
}
// Complete the printLinkedList function below.
/*
* For your reference:
*
* SinglyLinkedListNode {
* int data;
* SinglyLinkedListNode next;
* }
*
*/
static void printLinkedList(SinglyLinkedListNode head) {
System.out.println(head.data);
head = head.next;
if (head != null){
printLinkedList(head);
}
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
SinglyLinkedList llist = new SinglyLinkedList();
int llistCount = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < llistCount; i++) {
int llistItem = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
llist.insertNode(llistItem);
}
printLinkedList(llist.head);
scanner.close();
}
}