프로그래머스 "H-Index", JavaScript 풀이

function solution(citations) {
    // 내림차순 정렬
    citations.sort((a, b) => b - a);
    
    let hIndex = 0;
    for (let i=0; i < citations.length; i++) {
        const value = citations[i];
        const currentHIndex = i + 1 > value ? value : i + 1;
        if (hIndex > currentHIndex) {
            return hIndex;
        } else {
            hIndex = currentHIndex;
        }
    }
    
    return hIndex;
}