题解 | #寻找第K大# JS ordered map 61ms
寻找第K大
http://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf
const counter = (a_or_s) => { let m = new Map(); for (const x of a_or_s) m.set(x, m.get(x) + 1 || 1); return m; };
function findKth(a, n, k) {
a.sort((x, y) => y - x);
let m = counter(a), i = 1;
for (const [x, occ] of m) {
if (i >= k) {
return x;
}
i += occ;
}
}
module.exports = {
findKth : findKth
};
查看1道真题和解析