most of 1-1000

来源：互联网发布：november rain 知乎编辑：程序博客网时间：2024/06/04 19:49

#define  _CRT_SECURE_NO_WARNINGS#include<iostream>using namespace std;void search(int arr[] ,int len) {        int a[100] = {0};        int max = 0;        for (int i = 0; i < len; i++) {            int index = arr[i] - 1;            a[index]++;        }        for (int i = 0; i < 100; i++) {            if (a[i]>max)                 max = a[i];         }        cout << max<< endl;    //最多次数        for (int i = 0; i < 99; i++) {            if (max == a[i])                cout << i + 1;      //最多的数        }}int main() {    //求1-100数列中出现最多的数及次数    int arr[] = { 1, 55, 4, 4 ,9,9,9,9};    search(arr, sizeof(arr)/sizeof(arr[0]));    system("pause");    return 0;}

package pack;public class Main {    public static void main(String[] args) {        int[] arr = { 1, 3, 5, 6, 7, 8, 3, 4, 3 ,3};        search(arr, arr.length);    }    public static void search(int[] arr, int len) {        int max = 0;        int[] a = new int[100];        for (int i = 0; i < len; i++) {            int index = arr[i];            a[index-1]++;        }        for(int i = 0;i<100;i++) {            if(max<a[i])                max = a[i];        }        System.out.println(max);        for(int i = 0;i<100;i++) {            if(a[i]==max)                System.out.println(i+1);        }    }}

0 0