[LeetCode] Merge Two Sorted List | 난이도: Easy
문제 Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists. 주어진 두 연결 리스트(Linked List)를 합쳐서 정렬된 하나의 리스트로 만들어라. 예시 Input: l1 = [1,2,4], l2 = [1,3,4] Output: [1,1,2,3,4,4] Input: l1 = [], l2 = [0] Output: [0] Input: l1 = [], l2 = [] Output: [] 답안 /** * Definition for singly-linked list. * public class ListNode { * i..
