Hackerrank’in 30 Days of Code içerisinde bulunan “Day 15: Linked List” sorusunun açıklaması ve çözümü. Bu soruda linked list veri yapısına ve içerisindeki node’larda iterasyon yapılmasına göz atıyoruz.
► Hackerrank 30 Days of Code Çözümleri – Day 15: Linked List: https://www.hackerrank.com/challenges/30-linked-list/problem
► Problem açıklaması:
Today we will work with a Linked List. Check out the Tutorial tab for learning materials and an instructional video.
A Node class is provided for you in the editor. A Node object has an integer data field, data, and a Node instance pointer, next, pointing to another node (i.e.: the next node in the list).
A Node insert function is also declared in your editor. It has two parameters: a pointer, head, pointing to the first node of a linked list, and an integer, data, that must be added to the end of the list as a new Node object.
Complete the insert function in your editor so that it creates a new Node (pass data as the Node constructor argument) and inserts it at the tail of the linked list referenced by the head parameter. Once the new node is added, return the reference to the head node.
Note: The head argument is null for an empty list.
The first line contains T, the number of elements to insert.
Each of the next T lines contains an integer to insert at the end of the list.
Return a reference to the head node of the linked list.
4 T = 4
2 first data = 2
1 fourth data = 1
2 3 4 1
T = 4, so your method will insert 4 nodes into an initially empty list. First the code returns a new node that contains the data value 2 as the head of the list. Then create and insert nodes 3, 4, and a at the tail of the list.