LeetCode-023-合并K个升序链表
思路
归并排序即可,设置三个函数,所给函数,划分块的函数(调用自己然后划分成两两一组),以及一个链表合并函数
代码
/**
* 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 mergeKLists(ListNode[] lists) {
return merge(lists,0,lists.length-1);
}
public ListNode merge(ListNode []lists,int left,int right){
if(left==right) return lists[left];
if(left>right)return null;
int mid=(left+right)/2;
return mergeTwoList(merge(lists,left,mid),merge(lists,mid+1,right));
}
public ListNode mergeTwoList(ListNode a,ListNode b){
if(a==null||b==null)return a==null?b:a;
ListNode head=new ListNode();
ListNode aa=a,bb=b,hh=head;
while(aa!=null&&bb!=null){
if(aa.val<bb.val){
hh.next=aa;
aa=aa.next;
}
else {
hh.next=bb;
bb=bb.next;
}
hh=hh.next;
}
hh.next=aa==null?bb:aa;
return head.next;
}
}