8 lines
305 B
C++
8 lines
305 B
C++
/**
|
|
* 21. Merge Two Sorted Lists
|
|
* You are given the heads of two sorted linked lists list1 and list2.
|
|
* Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.
|
|
* Return the head of the merged linked list.
|
|
*
|
|
* Refer: more/0021.cpp
|
|
*/ |