HR30 Day 15: Linked List

1 개요

HR30 Day 15: Linked List

• https://www.hackerrank.com/challenges/30-linked-list/problem

해커랭크 30 Days of Code

문제	풀이
10-19 Day e
HR30 Day 10: Binary Numbers
HR30 Day 11: 2D Arrays
HR30 Day 12: Inheritance
HR30 Day 13: Abstract Classes
HR30 Day 14: Scope
HR30 Day 15: Linked List
HR30 Day 16: Exceptions - String to Integer
HR30 Day 17: More Exceptions
HR30 Day 18: Queues and Stacks
HR30 Day 19: Interfaces

2 Java

HR30 Day 15: Linked List/Java 문서를 참고하십시오.

    public static Node insert(Node head, int data) {
        Node newNode = new Node(data);
        if(head == null) {
            return newNode;
        }
        Node node = head;
        while(node.next != null) {
            node = node.next;
        }
        node.next = newNode;
        return head;
    }

3 PHP

HR30 Day 15: Linked List/PHP 문서를 참고하십시오.

    function insert($head, $data) {
        $newNode = new Node($data);
        if(is_null($head)) {
            return $newNode;
        }
        $node = $head;
        while(!is_null($node->next)) {
            $node = $node->next;
        }
        $node->next = $newNode;
        return $head;
    }

4 Python

HR30 Day 15: Linked List/Python 문서를 참고하십시오.

    def insert(self,head,data): 
        #Complete this method
        newNode = Node(data)
        if head is None:
            return newNode
        node = head
        while node.next is not None:
            node = node.next
        node.next = newNode
        return head