problem21

README

< Previous 　　　　　　　　　　　　　　　　 Next >

21. Merge Two Sorted Lists (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->3->4
Output: 1->1->2->3->4->4

Related Topics

[Linked List]

Similar Questions

1. Merge k Sorted Lists (Hard)
2. Merge Sorted Array (Easy)
3. Sort List (Medium)
4. Shortest Word Distance II (Medium)

Documentation

Index

• type ListNode

Types

type ListNode

type ListNode = kit.ListNode

ListNode - Definition for singly-linked list.