题目
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
思路
把两个有序链表归并成一个有序链表。先用比较笨但很简洁的办法:遍历两个有序链表的节点,比较节点值的大小,将较小值放入目标链表中,遍历完后如果两个链表有剩余节点,由于已经是有序的,插入目标链表的最后那个节点即可。