Commita8edbc1

committed

HARD/src/hard/MergeKSortedList.java

1 parentd882581 commita8edbc1Copy full SHA for a8edbc1

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+packagehard;`
	`2`	`+`
	`3`	`+importjava.util.Comparator;`
	`4`	`+importjava.util.PriorityQueue;`
	`5`	`+`
	`6`	`+importclasses.ListNode;`
	`7`	`+`
	`8`	`+/*As discussed with 司德君,王昊,薛博, this is super easy as long as you can think of heap, offer each of the head node into the min-heap./`
	`9`	`+`
	`10`	`+publicclassMergeKSortedList {`
	`11`	`+publicListNodemergeKLists(ListNode[]lists) {`
	`12`	`+PriorityQueue<ListNode>heap =newPriorityQueue(newComparator<ListNode>(){`
	`13`	`+@Override`
	`14`	`+publicintcompare(ListNodeo1,ListNodeo2) {`
	`15`	`+returno1.val -o2.val;`
	`16`	`+ }`
	`17`	`+ });`
	`18`	`+`
	`19`	`+for(ListNodenode :lists){`
	`20`	`+if(node !=null)heap.offer(node);`
	`21`	`+ }`
	`22`	`+`
	`23`	`+ListNodepre =newListNode(-1);`
	`24`	`+ListNodetemp =pre;`
	`25`	`+while(!heap.isEmpty()){`
	`26`	`+ListNodecurr =heap.poll();`
	`27`	`+temp.next =curr;`
	`28`	`+temp =temp.next;`
	`29`	`+if(curr.next !=null)heap.offer(curr.next);`
	`30`	`+ }`
	`31`	`+returnpre.next;`
	`32`	`+ }`
	`33`	`+}`

Comments

(0)