changetocs的博客

快排public class Solution { public void quickSort(int[] a, int left, int right) { int index = partition(a, left, right); if(left < index - 1) quickSort(a, left, index - 1); if

1、1000万video用id（long）标识，每个video有一个分数，取出其中分数高的前1000个。public class Video { long id; double score; }public class Solution { public Video[] getTopK(ArrayList<Video> data, int k){ Queue<