牛客题霸——NC88 寻找第K大(Javascript)

一、题目地址

https://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf?tpId=188&&tqId=38572&rp=1&ru=/activity/oj&qru=/ta/job-code-high-week/question-ranking

二、思路视频

https://www.bilibili.com/video/BV1x7411L7Q7?p=154

三、具体代码

/**
 * 
 * @param a int整型一维数组 
 * @param n int整型 
 * @param K int整型 
 * @return int整型
 */
function findKth( a ,  n ,  K ) {
    // write code here
    if(n==0 || K>n)
        return [];
    quickSort(a,0,n-1);
    return a[n-K];
}
function quickSort(a, l, r){
    if(l>=r) return;
    let i=l, j=r, flag=a[i];
    while(i<j){
        while(i<j && a[j] > flag)
            j--;
        while(i<j && a[i] <= flag)
            i++;
        swap(a, i, j);
    }
    swap(a, i, l);
    quickSort(a, l,i-1);
    quickSort(a, i+1, r);
}
var swap = (a, i, j)=>{
    if(a.length == 0) return;
    let temp = a[j];
    a[j] = a[i];
    a[i] = temp;
};
module.exports = {
    findKth : findKth
};