首页 > 代码库 > [LeetCode] Merge Two Sorted Lists
[LeetCode] 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.
public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if ( l1 == null && l2 == null) return null; else if (l1 == null) return l2; else if (l2 == null) return l1; ListNode head; head = (l1.val < l2.val) ? l1 : l2; ListNode now = new ListNode(0); ListNode head1 = l1; ListNode head2 = l2; while (head1 != null && head2 != null) { if ( head1.val < head2.val) { now.next = head1; head1 = head1.next; } else { now.next = head2; head2 = head2.next; } now = now.next; } if (head1 != null) now.next = head1; else now.next = head2; return head; }}
[LeetCode] Merge Two Sorted Lists
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。