LeetCode-21.Merge Two Sorted Lists
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.
Example:
Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | public ListNode mergeTwoLists(ListNode l1, ListNode l2) { //链表 my ListNode node = new ListNode( 0 ); ListNode curr= node; while ( null !=l1&& null !=l2){ if (l1.val<l2.val){ curr.next=l1; l1=l1.next; curr=curr.next; curr.next= null ; } else { curr.next=l2; l2=l2.next; curr=curr.next; curr.next= null ; } } if ( null !=l1){ curr.next=l1; } else { curr.next=l2; } return node.next; } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步