题目链接:. - 力扣(LeetCode)
递归思路:
1.确定终止条件:如果链表1为空,则返回链表2,如果链表2为空,则返回链表1
2.传递参数:链表1,链表2,新创建的链表
3.单层递归逻辑:如果链表1当前节点值小于或等于链表2当前节点的值,新链表指向链表1,并且确定新链表的下一个指向。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode res = new ListNode();
return solution(list1, list2, res);
}
public ListNode solution(ListNode list1, ListNode list2, ListNode res) {
if (list1 == null)
return list2;
if (list2 == null)
return list1;
if (list1.val <= list2.val) {
res = list1;
res.next = solution(list1.next, list2, res);
} else {
res = list2;
res.next = solution(list2.next, list1, res);
}
return res;
}
}