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