合并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) {
ListNode res =null;
//例子:lists = [[1,4,5],[1,3,4],[2,6]]。Lists的长度为3,Lists[0]=[1,4,5];Lists[1]=[1,3,4];Lists[2]=[2,6];
for( int i =0 ; i< lists.length;i++){
res=mergeTwoLists(res,lists[i]);
}
return res;
}
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
//用递归
//终止条件
if(list1== null){
return list2;
}
if(list2== null){
return list1;
}
if(list1.val < list2.val){
list1.next =mergeTwoLists(list1.next,list2);
return list1;
}
else{
list2.next =mergeTwoLists(list2.next,list1);
return list2;
}
}
}
用分治的方法进行比较(合并的次数确实是一样的,但是方法一随着比较,链表的长度会逐渐增加,再继续的话最坏的时间自然会更高。方法二能保证链表的长度没方法一长。)
/**
* 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) {
if (lists == null || lists.length == 0) return null;
return merge (lists,0,lists.length-1);
}
//用分治的思想进行比较,很大的节省时间
public ListNode merge(ListNode[] lists,int left,int right){
if(left==right){
return lists[left];
}
int mid =left+(right-left)/2;
ListNode m =merge(lists,left,mid);
ListNode n =merge(lists,mid+1,right);
return mergeTwoLists(m,n);
}
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
//用递归
//终止条件
if(list1== null){
return list2;
}
if(list2== null){
return list1;
}
if(list1.val < list2.val){
list1.next =mergeTwoLists(list1.next,list2);
return list1;
}
else{
list2.next =mergeTwoLists(list2.next,list1);
return list2;
}
}
}