[정렬] H-index

[프로그래머스] H-index

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

*처음 푼 풀이

package com.company;
import java.util.Arrays;

public class Main {

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

        //0 1 3 5 6
        Arrays.sort(citations);
        int hIndex=0;
        int lastValue = citations[citations.length-1];

        for(int i=0; i<=lastValue; i++){

            for(int j=0; j<citations.length; j++){
                if(i <= citations[j]){ //질을 충족하는가
                    if(i <= citations.length-j){ //양을 충족하는가
                        hIndex=i;
                        break;
                    }
                }
            }

        }//for(i)

        System.out.println(hIndex);
        
    }
}

*다른 풀이

int hIndex = 0;
    for(int i=0; i<citations.length; i++){
        int smaller = Math.min(citations[i], citations.length-i);
        hIndex = Math.max(result, smaller);
    }