Print the Elements of a Linked List Hackerrank Solution - java

 Print the Elements of a Linked List Hackerrank Solution - java

For Explanation Watch Video :

code:

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.regex.*;

public class Solution {

    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) {

        while(head!=null){

            System.out.println(head.data);

            head = head.next;

        }

    }

    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();

    }

}