H-Index (정렬)

원본 : https://school.programmers.co.kr/learn/courses/30/lessons/42747

프로그래머스

 

풀이

import java.util.*;

class Solution {
    public int solution(int[] citations) {
        int n = citations.length;

        Arrays.sort(citations);

        int answer = 0;

        for (int h = 1; h <= n; h++) {
            if (isH_Index(citations, h)) {
                answer = h;
            } else {
                break;
            }
        }

        return answer;
    }

    public boolean isH_Index(int[] arr, int h) {
        int cnt = arr.length;

        for (int num : arr) {
            if (num < h) {
                cnt--;
            } else {
                break;
            }
        }

        return cnt >= h;
    }
}