直接一手暴力击倒了全国5.16%的网友
class Solution {
ListNode ans = new ListNode();
public ListNode mergeKLists(ListNode[] lists) {
int n = lists.length;
ans.next = null;
ListNode p = ans;
int over = 0;
for (int i = 0; i < n; i ++ ) if (lists[i] != null) over++;
while (true) {
if (over == 0) break;
int Min = 0x3f3f3f3f;
int pos = 0;
System.out.println(lists.length);
for (int i = 0; i < n; i ++) {
if (lists[i] == null) continue;
if (lists[i].val < Min) {
Min = lists[i].val;
pos = i;
}
}
p.next = lists[pos];
lists[pos] = lists[pos].next;
if (lists[pos] == null) over -- ;
System.out.println(pos + " " + over);
p = p.next;
}
return ans.next;
}
}
佬