30 삐약 : 백준 10807[바킹독 문제 풀이|배열|JAVA]

https://www.acmicpc.net/problem/10807

10807번: 개수 세기

 

 

package BKD_0x2_Array;

import java.util.Scanner;

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

        int[] arr = new int[N];

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

        int v = sc.nextInt();

        System.out.println(find_num(v,arr));

    }

    public static int find_num(int v, int[] arr){
        int count =0;
        for (int num : arr ) {
            if(num == v) count++;
        }
        return count;
    }
}