LeetCode에서 Merge Two Sorted Lists 풀어보기 | HooneyLog

function mergeTwoLists(list1: ListNode | null, list2: ListNode | null): ListNode | null {
    
    let newNodeList = new ListNode(0);
    const result = newNodeList;
    
    while(list1 !== null && list2 !== null) {
        if(list1.val < list2.val) {
            newNodeList.next = list1;
            list1 = list1.next;
        }
        else {
            newNodeList.next = list2;
            list2 = list2.next;
        }
        newNodeList = newNodeList.next;
    }
    
			if(list1 !== null) newNodeList.next = list1;
	    if(list2 !== null) newNodeList.next = list2;

    return result.next
};