题目:合并两个已排序链表 难度:Easy 题目内容: 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. 翻译: 合并两个已排序的链表,并将其作为一个新链表返回.新的链表应该通过将前两个列表的节点拼接在一起. Example: Input: 1->2->4, 1-&…