[프로그래머스 | Java Lv.2] [복습] H-index (정렬)

문제

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

프로그래머스

---

접근

아니 난 이 문제가 왜이렇게 어렵지?

 

최종코드

package week6.baek.sort;

import java.util.Arrays;

public class HIndex {
    public static int solution(int[] citations) {
        Arrays.sort(citations);

        int h=0;
        for (int i = 0; i < citations.length; i++) {
            int discussionCount = citations.length - i;

            if (citations[i] >= discussionCount) {
                h = discussionCount;
                break;
            }
        }
        return h;
    }

    public static void main(String[] args) {
        int[] citations = {3, 0, 6, 1, 5};
        System.out.println(solution(citations));
    }
}

---

참고

https://hstory0208.tistory.com/entry/Java%EC%9E%90%EB%B0%94-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-Lv2-H-Index

[Java/자바] 프로그래머스 Lv2 - H-Index