Leetcode题解-排序-347

[Hzbmangguo]

要判断list的容量与k-topk.size()的大小。不然下标会越界。
int size=k-topk.size()>buckets[i].size()?buckets[i].size():k-topk.size();
topk.addAll(buckets[i].subList(0,size));

[CyC2018]

@Hzbmangguo 现在的实现能避免越界哈

            if (buckets[i].size() <= (k - topK.size())) {
                topK.addAll(buckets[i]);
            } else {
                topK.addAll(buckets[i].subList(0, k - topK.size()));
            }