[HackerLank] Merge two sorted linked lists - 문제풀이 Description 두개의 정렬된 링크드리스트(Linked List)를 머지하여 반환하는 문제입니다. Solution 1. Merge Two pointers static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) { SinglyLinkedListNode dHead = new SinglyLinkedListNode(0); SinglyLinkedListNode cur = dHead; while(head1 != null && head2 !=null){ if(head1.data 알고리즘/HackerRank 2022. 3. 25. 04:24