๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

[๋ฐฐ์—ด] 8. ๋“ฑ์ˆ˜๊ตฌํ•˜๊ธฐ

์‹œํ๋ฆฌํ‹ฐ์ง€ํ˜ธ 2023. 12. 18.
8. ๋“ฑ์ˆ˜๊ตฌํ•˜๊ธฐ
 

์„ค๋ช…

N๋ช…์˜ ํ•™์ƒ์˜ ๊ตญ์–ด์ ์ˆ˜๊ฐ€ ์ž…๋ ฅ๋˜๋ฉด ๊ฐ ํ•™์ƒ์˜ ๋“ฑ์ˆ˜๋ฅผ ์ž…๋ ฅ๋œ ์ˆœ์„œ๋Œ€๋กœ ์ถœ๋ ฅํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์„ธ์š”.

๊ฐ™์€ ์ ์ˆ˜๊ฐ€ ์ž…๋ ฅ๋  ๊ฒฝ์šฐ ๋†’์€ ๋“ฑ์ˆ˜๋กœ ๋™์ผ ์ฒ˜๋ฆฌํ•œ๋‹ค.

์ฆ‰ ๊ฐ€์žฅ ๋†’์€ ์ ์ˆ˜๊ฐ€ 92์ ์ธ๋ฐ 92์ ์ด 3๋ช… ์กด์žฌํ•˜๋ฉด 1๋“ฑ์ด 3๋ช…์ด๊ณ  ๊ทธ ๋‹ค์Œ ํ•™์ƒ์€ 4๋“ฑ์ด ๋œ๋‹ค.

์ž…๋ ฅ

์ฒซ ์ค„์— N(3<=N<=100)์ด ์ž…๋ ฅ๋˜๊ณ , ๋‘ ๋ฒˆ์งธ ์ค„์— ๊ตญ์–ด์ ์ˆ˜๋ฅผ ์˜๋ฏธํ•˜๋Š” N๊ฐœ์˜ ์ •์ˆ˜๊ฐ€ ์ž…๋ ฅ๋œ๋‹ค.

์ถœ๋ ฅ

์ž…๋ ฅ๋œ ์ˆœ์„œ๋Œ€๋กœ ๋“ฑ์ˆ˜๋ฅผ ์ถœ๋ ฅํ•œ๋‹ค.

์˜ˆ์‹œ ์ž…๋ ฅ 1 

5
87 89 92 100 76

์˜ˆ์‹œ ์ถœ๋ ฅ 1

4 3 2 1 5

 

 

 

<<ํ’€์ด>>

-๋‚˜์˜ ํ’€์ด-

 

์ด๋ฒˆ ๋ฌธ์ œ๋Š” ์กฐ๊ธˆ๋งŒ ์ƒ๊ฐํ•˜๋ฉด ์‰ฝ๋‹ค. ๋จผ์ € ์˜์‚ฌ์ฝ”๋“œ๋ฅผ ์ƒ๊ฐํ•˜๊ณ  ๊ตฌ์ƒํ•˜๊ฒŒ ๋œ๋‹ค.

์ด์ค‘ for๋ฌธ์„ ์‚ฌ์šฉํ•ด์•ผ ํ•œ๋‹ค. 

 

*์ฃผ์˜ ํ•  ์ ์€ int count ๊ฐ™์€ ๊ฐ’๋“ค์˜ ์œ„์น˜์ด๋‹ค. ์ž˜๋ชป ๋ฐฐ์น˜ํ•˜๋ฉด ๊ฐ’์ด ๋ˆ„๋ฝ์ด ๋œ๋‹ค.

import java.util.Scanner;

class Main {


    public int[] solution(int[] arr, int n) {
        int[] answer = new int[n];
        for (int i = 0; i < n; i++) {
            int count = 1;
            for (int j = 0; j < n; j++) {
                if (arr[i] < arr[j]) count++;
            }
            answer [i] = count;
        }

        return answer;
    }



    public static void main(String[] args) {
        Main T = new Main();
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
        }

        for (int x : T.solution(arr, n)) {
            System.out.print(x + " ");
        }
    }
}

 

 

์ด๋ฒˆ ๊ฐ•์‚ฌ๋‹˜ ํ’€์ด๋Š” ๋‚˜์™€ ๊ฐ™๊ธฐ์— ์ƒ๋žตํ•˜๊ฒ ๋‹ค.

๋Œ“๊ธ€