题目描述
合并K个已排序的链表并将其作为一个已排序的链表返回。分析并描述其复杂度。
堆解法
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Solution {
public ListNode mergeKLists(ArrayList<ListNode> lists) {
if(lists.size() == 0){
return null;
}
PriorityQueue<ListNode> heap = new PriorityQueue<>(lists.size(), new Comparator<ListNode>(){
public int compare(ListNode l1, ListNode l2){
if(l1.val > l2.val){
return 1;
}else if(l1.val == l2.val){
return 0;
}else{
return -1;
}
}
});
for(ListNode li : lists){
if(li != null){
heap.offer(li);
}
}
ListNode head = new ListNode(0);
ListNode cur = head;
while(!heap.isEmpty()){
cur.next = heap.poll();
cur = cur.next;
if(cur.next != null){
heap.offer(cur.next);
}
}
return head.next;
}
}
尝试在原集合上做改动,失败了,没有通过
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Solution {
public ListNode mergeKLists(ArrayList<ListNode> lists) {
ListNode head = new ListNode(0);
ListNode cur = head;
while(!lists.isEmpty()){
int len = lists.size();
int min = lists.get(0).val;
int index = 0;
for(int i = 1; i < len; i++){
if(lists.get(i) != null && lists.get(i).val < min){
min = lists.get(i).val;
index = i;
}
}
cur.next = new ListNode(min);
cur = cur.next;
if(lists.get(index).next != null){
lists.add(lists.get(index).next);
}
lists.remove(index);
}
cur.next = null;
return head.next;
}
}