Merge two lists that have been sorted

Problem Description: Given a two-linked list of head pointers, and both linked lists are already in order, the two linked lists are merged into a list, and the merged list is still orderly.

Analysis: This problem is somewhat similar to the merge step in merge sort. Specific ideas are as follows:

First, compare the head nodes of the two lists, and the smaller ones as the head node of the merged list, then move the pointer, compare the nodes of the two pointers, and so on,

If one of the linked lists is finished, move the remaining nodes of the other list to the Consolidated list.

Because it is relatively simple, I will no longer write the specific program code, the reader can self-verify.

Merge two lists that have been sorted