Java的PriorityQueue构造函数的复杂性是Collection多少?我用了构造函数:
Collection
PriorityQueue(Collection<? extends E> c)
复杂度是O(n)还是O(n*log(n))?
java heap collections priority-queue binary-heap
binary-heap ×1
collections ×1
heap ×1
java ×1
priority-queue ×1