-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeKSortedLists.java
70 lines (59 loc) · 1.8 KB
/
MergeKSortedLists.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/**
* 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 MergeKSortedLists {
/*
Runtime: 6 ms, faster than 28.58% of Java online submissions for Merge k Sorted Lists.
Memory Usage: 40 MB, less than 93.38% of Java online submissions for Merge k Sorted Lists.
*/
ArrayList<Integer> flist=new ArrayList<>();
ListNode head=null,temp=null;
public ListNode mergeKLists(ListNode[] lists) {
if((lists==null||lists.length==0)) return null;
if(lists.length==1)
{
if((lists[0]==null)) return null;
else return lists[0];
}
int size=lists.length;
int cnull=0;
while(cnull!=size)
{
ArrayList<Integer> nums=new ArrayList<>();
for(int i=0;i<lists.length;i++)
{
if(lists[i]!=null) nums.add(lists[i].val);
}
//Collections.sort(nums);
flist.addAll(nums);
cnull=0;
for(int j=0;j<lists.length;j++)
{
if(lists[j]!=null)lists[j]=lists[j].next;
else{ cnull++;}
}
}
Collections.sort(flist);
for(int i=0;i<flist.size();i++)
{
if(head==null)
{
head=new ListNode(flist.get(i));
temp=head;
}
else
{
temp.next=new ListNode(flist.get(i));
temp=temp.next;
}
}
return head;
}
}