(ListNode o1, ListNode o2)
| 47 | if (lists.length == 0) return null; |
| 48 | PriorityQueue<ListNode> queue = new PriorityQueue<>(lists.length, new Comparator<ListNode>() { |
| 49 | @Override |
| 50 | public int compare(ListNode o1, ListNode o2) { |
| 51 | if (o1.val < o2.val) return -1; |
| 52 | else if (o1.val == o2.val) return 0; |
| 53 | else return 1; |
| 54 | } |
| 55 | }); |
| 56 | ListNode node = new ListNode(0), tmp = node; |
| 57 | for (ListNode l : lists) { |
nothing calls this directly
no outgoing calls
no test coverage detected