[java] 프로그래머스 H-index

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

프로그래머스

 

 

 

 

 

풀이 1

package main;
import java.util.*;



public class Main {
	

	 public int solution(int[] citations) {
	        int answer = 0;
	        
	        Arrays.sort(citations);
	        for(int i=0; i<citations.length; i++) {
	        	if(citations[i]>= citations.length-i) {
	        		answer = citations.length - i;
	        		break;
	        	}
	        }
	        
	        
	        return answer;
	    }
	    
	
	
	public static void main(String[] args) {
		Main T = new Main();
		Scanner sc = new Scanner(System.in);
		int[] array = {6,5,4,1,0};
	
		System.out.print(T.solution(array));
		
	
	}}

 

 

 

풀이2

package main;
import java.util.*;



public class Main {
	

	 public int solution(int[] citations) {
	        int answer = 0;
	       

	        Arrays.sort(citations);
	       
	        for(int h=citations.length; h>=0; h--) {
	        	int cnt =0;
	        	for(int idx = citations.length-1; idx>=0; idx--) {
	        		int num = citations[idx];
	        		if(num >= h) cnt++;
	        		else break;
	        	}
	        	
	        	if(cnt>= h) {
	        		answer = h;
	        		break;
	        	}
	        }
	        
	        
	        return answer;
	    }
	    
	
	public static void main(String[] args) {
		Main T = new Main();
		Scanner sc = new Scanner(System.in);
		int[] array = {6,5,4,1,0};
	
		System.out.print(T.solution(array));
		
	
	}}

 

 

 

참고

https://leeeehhjj.tistory.com/80