Obtenir le numéro le plus "populaire" de la matrice

Si vous n'êtes pas autorisé à utiliser la collection, vous pouvez essayer ci-dessous le code:

public int getPopularNumber(){
    int inputArr[] = {1, 2, 3, 4, 4, 5 ,4 ,5 ,5}; // given input array
    int[] tempArr = new int[inputArr.length];
    int[] maxValArr = new int[inputArr.length];

    // tempArr will have number as index and count as no of occurrence
    for( int i = 0 ; i < inputArr.length ; i++){
        tempArr[inputArr[i]]++;     
    }

    int maValue = 0;
    // find out max count of occurrence (in this case 3 for value 4 and 5) 
    for( int j = 0 ; j < tempArr.length ; j++){
        maValue = Math.max(maValue, tempArr[j]);        
    }

    int l =0;
    // maxValArr contains all value having maximum occurrence (in this case 4 and 5)
    for( int k = 0 ; k < tempArr.length ; k++){
        if(tempArr[k] == maValue){
            maxValArr[l] = k;
            l++;
        }       
    }

    return maxValArr[(int)(Math.random() * getArraySize(maxValArr))];

}

private int getArraySize(int[] arr) {
    int size = 0;
    for( int i =0; i < arr.length ; i++){
        if(arr[i] == 0){
            break;
        }
        size++;
    }
    return size;
}

C'est dur comme l'enfer: D Après avoir essayé, je suppose que je suppose que je l'ai (s'il y aura 2 chiffres avec la même fréquence, il sera d'abord retrouvé trouvé):

public static void main(String[] args) {
    //income array
    int[] array= {1,1,1,1,50,10,20,20,2,2,2,2,20,20};

    //associated unique numbers with frequency
    int[][] uniQFreqArr = getUniqValues(array);

    //print uniq numbers with it's frequency
    for (int i = 0; i < uniQFreqArr.length; i++) {
        System.out.println("Number: " + uniQFreqArr[i][0] + "  found : " + uniQFreqArr[i][1]);
    }

    //get just most frequency founded numbers
    int[][] maxFreqArray = getMaxFreqArray(uniQFreqArr);

    //print just most frequency founded numbers
    System.out.println("Most freq. values");
    for (int i = 0; i < maxFreqArray.length; i++) {
        System.out.println("Number: " + maxFreqArray[i][0] + "  found : " + maxFreqArray[i][1]);
    }

    //get some of found values and print
    int[] result = getRandomResult(maxFreqArray);
    System.out.println("Found most frequency number: " + result[0] + " with count: " + result[1]);
}

//get associated array with unique numbers and it's frequency
static int[][] getUniqValues(int[] inArray){
    //first time sort array
    Arrays.sort(inArray);

    //default value is null, not zero as in int (used bellow)
    Integer[][] uniqArr = new Integer[inArray.length][2];

    //counter and temp variable
    int currUniqNumbers=1;
    int actualNum = inArray[currUniqNumbers-1];

    uniqArr[currUniqNumbers-1][0]=currUniqNumbers;
    uniqArr[currUniqNumbers-1][1]=1;

    for (int i = 1; i < inArray.length; i++) {
        if(actualNum != inArray[i]){
            uniqArr[currUniqNumbers][0]=inArray[i];
            uniqArr[currUniqNumbers][1]=1;
            actualNum = inArray[i];
            currUniqNumbers++;
        }else{
            uniqArr[currUniqNumbers-1][1]++;
        }
    }

    //get correctly lengthed array
    int[][] ret = new int[currUniqNumbers][2];
    for (int i = 0; i < uniqArr.length; i++) {
        if(uniqArr[i][0] != null){
            ret[i][0] = uniqArr[i][0];
            ret[i][1] = uniqArr[i][1];
        }else{
            break;
        }
    }
    return ret;
}

//found and return most frequency numbers
static int[][] getMaxFreqArray(int[][] inArray){
    int maxFreq =0;
    int foundedMaxValues = 0;

    //filter- used sorted array, so you can decision about actual and next value from array
    for (int i = 0; i < inArray.length; i++) {
        if(inArray[i][1] > maxFreq){
            maxFreq = inArray[i][1];
            foundedMaxValues=1;
        }else if(inArray[i][1] == maxFreq){
            foundedMaxValues++;
        }
    }

    //and again copy to correctly lengthed array
    int[][] mostFreqArr = new int[foundedMaxValues][2];
    int inArr= 0;
    for (int i = 0; i < inArray.length; i++) {
        if(inArray[i][1] == maxFreq){
            mostFreqArr[inArr][0] = inArray[i][0];
            mostFreqArr[inArr][1] = inArray[i][1];
            inArr++;
        }
    }
    return mostFreqArr;
}

//generate number from interval and get result value and it's frequency
static int[] getRandomResult(int[][] inArray){
    int[]ret=new int[2];
    int random = new Random().nextInt(inArray.length);

    ret[0] = inArray[random][0];
    ret[1] = inArray[random][1];
    return ret;
}