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.
题解:合并两个有序的链表,解法有两种,一种是内部循环,一种是递归,递归的效率肯定不如函数内部循环,所以我的解法就是创建一个头节点,里面随便放入一个值,然后将两个链表进行依次比较,把较小的节点放在头节点后面,较小的节点的链表的头节点后移一位,直到一个链表为空停止;循环停止以后肯定一个链表为空,将不为空的链表连接到新的链表后面。
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* head = new ListNode(0);
ListNode* pt = head;
while(l1!= NULL && l2 != NULL){
if(l1->val > l2->val){
pt->next = l2;
l2 = l2->next;
}else{
pt->next = l1;
l1 = l1->next;
}
pt = pt->next;
}
pt->next = l1 == NULL ? l2 : l1;
return head->next;
结果: