๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ๋“ฑ์ˆ˜๊ตฌํ•˜๊ธฐ ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ๋“ฑ์ˆ˜๊ตฌํ•˜๊ธฐ

์š”์ผ์ด 2021. 4. 28. 22:54
๋ฐ˜์‘ํ˜•

๋ฌธ์ œ

import java.util.*;
import java.io.*;

public class Main {
	
	public void solution(int num, int[] array) {
		// ์ „์ฒด ํ•˜๋‚˜์”ฉ ๋น„๊ต๋ฅผ ํ•˜๋ฉด์„œ
		for(int i=0; i<num; i++) {
        	
			int count = num+1;
			int compare = array[i];
            
			for(int j=0; j<num; j++) {
				// i์˜ ๋ฐฐ์—ด๊ฐ’์ด ๋‹ค๋ฅธ ๊ฐ’๋“ค๋ณด๋‹ค ํฌ๋ฉด
            	if(compare >= array[j]) {
                	// count ๋นผ๊ธฐ
					count --;
				}
			}
		 System.out.printf(count + " ");
		}
	}

	public static void main(String args[]) {
        Main main = new Main();
		Scanner in= new Scanner(System.in);
        int num = in.nextInt();
        int[] array = new int[num];
        for(int i=0; i<num; i++) {
        	array[i] = in.nextInt();
        }
        main.solution(num, array);
    }

}
Comments