本文共 825 字,大约阅读时间需要 2 分钟。
题目描述
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4 限制:0 <= 链表长度 <= 1000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。java
用递归实现/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1==null) return l2; if(l2==null) return l1; ListNode pMergeHead=null; if(l1.val<=l2.val){ pMergeHead=l1; pMergeHead.next=mergeTwoLists(l1.next,l2); }else{ pMergeHead=l2; pMergeHead.next=mergeTwoLists(l1,l2.next); } return pMergeHead; }}