[BackJoon] JAVA 단계별 풀이 : 04. 1차원 배열 (completion)

 

 

[문제 풀이 완료 목록]

☑️ 최소, 최대

☑️ 최댓값

☑️ 나머지

☑️ 평균

☑️ OX퀴즈

☑️ 평균은 넘겠지

 

 

[1차원 배열]

최소, 최대

10818번: 최소, 최대

문제 번호 : 10818

단계 : 1

package jokun.BackJoon.step4;

import java.util.Scanner;

public class Practice10818 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int num = sc.nextInt();
        int[] numArr = new int[num];
        sc.nextLine();

        for (int i = 0; i < num; i++) {
            numArr[i] = sc.nextInt();
        }

        int min = numArr[0];
        int max = numArr[0];

        for (int i = 0; i < numArr.length; i++) {
            if(min > numArr[i]){
                min = numArr[i];
            }
            if(max < numArr[i]){
                max = numArr[i];
            }
        }
        System.out.println(min + " " + max);
    }
}

 

 

 

최댓값

문제 번호 : 2562

단계 : 2

package jokun.BackJoon.step4;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Practice2562 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        List<Integer> numList = new ArrayList<>();

        for (int i = 0; i < 9; i++) {
            int num = sc.nextInt();
            numList.add(num);
        }
        System.out.println(Collections.max(numList));
        System.out.println(numList.indexOf(Collections.max(numList)) + 1);
    }
}

 

 

 

나머지

3052번: 나머지

문제 번호 : 3052

단계 : 3

package jokun.BackJoon.step4;

import java.util.*;

public class Practice3052 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        Set<Integer> numList = new HashSet<>();

        for (int i = 0; i < 10; i++) {
            int num = sc.nextInt();
            numList.add(num % 42);
        }
        System.out.println(numList.size());
    }
}

 

 

 

 

평균

1546번: 평균

문제 번호 : 1546

단계 : 4

package jokun.BackJoon.step4;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Practice1546 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int subjectNum = sc.nextInt();
        sc.nextLine();

        List<Integer> subjectScore = new ArrayList<>();
        int score = 0;

        for (int i = 0; i < subjectNum; i++) {
            score = sc.nextInt();
            subjectScore.add(score);
        }
        int max = Collections.max(subjectScore);

        int sum = 0;
        for (Integer integer : subjectScore) {
            sum += integer;
        }

        System.out.println(sum * 100.0  / subjectNum / max);
    }
}

 

 

 

 

OX퀴즈

8958번: OX퀴즈

문제 번호 : 8958

단계 : 5

package jokun.BackJoon.step4;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Practice8958 {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();

        for (int i = 0; i < num; i++) {
            int cnt = 0;
            int fullCnt = 0;

            List<Character> oxList = new ArrayList<>();
            String ox = sc.next();

            for (int j = 0; j < ox.length(); j++) {
                oxList.add(ox.charAt(j));

                if (oxList.get(j) == 'O'){
                    cnt = cnt + 1;
                }else {
                    cnt = 0;
                }
                fullCnt = fullCnt + cnt;
            }
        System.out.println(fullCnt);
        }
    }
}

 

 

 

평균은 넘겠지

4344번: 평균은 넘겠지

문제 번호 : 4344

단계 : 6

package jokun.BackJoon.step4;

import java.util.Scanner;

public class Practice4344 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int C = in.nextInt();

        for(int i=0; i<C; i++){
            int N[]= new int[in.nextInt()];
            int sum=0;

            for(int j=0; j<N.length; j++){
                int grade = in.nextInt();
                N[j] = grade;
                sum += grade;
            }
            double avr=sum/N.length;
            double count = 0;

            for(int k=0; k<N.length; k++){
                if(N[k] > avr){
                    count++;
                }
            }
            System.out.printf("%.3f",count/N.length*100);
            System.out.println("%");
        }
    }
}