题目:
解答:
1. 递归解决,终止条件:l1为空或者l2位空(同时为空已经在l1那里判断了)
怎样递归:
l1的值比较小或者两个值相等,就把l1->next和l2合并,放进l1->next,返回l1;
l2的值比较小,就把l1和l2->next合并,放进l2->next,返回l2;
/**
* 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;
}
else if (l2 == NULL) {
return l1;
}
else {
if (l1->val <= l2->val) {
l1->next = mergeTwoLists(l1->next, l2);
return l1;
}
else {
l2->next = mergeTwoLists(l1, l2->next);
return l2;
}
}
}
};