题目:
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.
解答:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if(l1 == NULL) {
return l2;
}
if(l2 == NULL) {
return l1;
}
ListNode *head;
if(l1 -> val < l2 -> val) {
head = l1;
l1 -> next = mergeTwoLists(l1 -> next, l2);
}
else {
head = l2;
l2 -> next = mergeTwoLists(l1, l2 -> next);
}
return head;
}
};
思路:
如果企图用多个指针从前至后遍历两个链表,然后对相应的next做修改,那工作量可不小。其实最简单的方法是递归:
每一次递归,如果两个链表某一个为空,则返回另一个链表;如果两个链表都不为空,则判断两个链表当前头部元素的大小,设置数值小的节点为头部,然后递归。这样做,每一次都能够确定当前全局最小的元素,由此把两个排好序的链表merge成一个排好序的链表。