Defind Count Method


Submit solution

Points: 40 (partial)
Time limit: 1.0s
Memory limit: 256M

Authors:
Problem type
Allowed languages
Java 19, Java 8

題目說明

請寫出Count方法,計算陣列中的目標數有幾個

import java.util.Scanner;

public class defindCountMethod {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        int len = input.nextInt();
        int[] nums = new int[len];
        for (int i = 0; i < len; i++) {
            nums[i] = input.nextInt();
        }
        int target = input.nextInt();
        input.close();

        System.out.print(target + " has " + Count(nums, target));   // 呼叫副程式
    }

    // 定義Count方法


}

輸入限制:0~9的整數

輸入

陣列長度
陣列資料
目標數

輸出

(目標數) has (幾個)

測試資料1 輸入

6
2 5 3 1 0 4
0

測試資料1 輸出

0 has 1
// 0在陣列裡出現1次

Comments


  • 0
    scu09156146  commented on April 12, 2024, 5:25 p.m.

    題解

    import java.util.Scanner;
    
    public class MyProgram {
    
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            Scanner input = new Scanner(System.in);
            int len = input.nextInt();
            int[] nums = new int[len];
            for (int i = 0; i < len; i++) {
                nums[i] = input.nextInt();
            }
            int target = input.nextInt();
            input.close();
    
            System.out.print(target + " has " + Count(nums, target)); // 呼叫副程式,印出回傳值
        }
    
        // 定義Count方法
        public static int Count(int[] array, int target) {
            int count = 0;
            for (int i = 0; i < array.length; i++) {
                if (array[i] == target)
                    count++;
            }
            return count;
        }
    
    }