关于top N问题

思路1：堆处理

    //最小k个数字
    public int[] smallestK(int[] arr, int k) {
        if (arr.length==0)return arr;
        // 初始化成小顶堆
        for (int i = arr.length / 2 - 1; i >=0; i--) {
            adjust(arr, i, arr.length);
        }
        int n = k - 1;
        //因为不需要保持前n的有序，所以只需要到n
        for (int i = arr.length-1; i >n ; i--) {
            swap(arr,0,i);
            adjust(arr,0,i);
        }
        return arr;
    }

    //堆排序的堆调整
    private void adjust(int[] arr, int index, int length) {
        int tmp = arr[index];
        for (int i = index * 2 + 1; i < length; i = i * 2 + 1) {
            if (i + 1 < length && arr[i] < arr[i + 1]) {
                i++;
            }

            if (tmp < arr[i]) {
                arr[index] = arr[i];
                index = i;
            } else {
                break;
            }
        }
        arr[index] = tmp;
    }

    private void swap(int[] arr, int idx1, int idx2) {
        int tmp = arr[idx1];
        arr[idx1] = arr[idx2];
        arr[idx2] = tmp;
    }

思路2：快速排序法分治思想

    //最小k个数字
    int bound;
    public int[] smallestK(int[] arr, int k) {
        if (arr.length == 0) return arr;
        bound=k;
        qs(arr,0,arr.length-1);
        return arr;
    }

    private void qs(int[] arr, int left, int right) {
        if (left>right||left>=bound)return;
        int i = left, j = right;
        int base = arr[i];
        while (i < j) {
            while (i < j && arr[j] >= base) j--;
            if (i<j){
                arr[i]=arr[j];
                i++;
            }
            while (i < j && arr[i] <= base) i++;
            if (i<j){
                arr[j]=arr[i];
                j--;
            }
        }
        arr[i]=base;
        if (i==bound)return;
        qs(arr,left,i-1);
        qs(arr,i+1,right);
    }