Question

Write a method mostFrequentDigit that returns the digit value that occurs most frequently in a number. Example: The number 669260267 contains: one 0, two 2s, four 6es, one 7, and one 9. mostFrequentDigit(669260267) returns 6. If there is a tie, return the digit with the lower value. mostFrequentDigit(57135203) returns 3.

Answer 1

public static int mostFrequentDigit(int num) {

int[] count = new int[10];

while (num > 0) {

int digit = num % 10;

count[digit]++;

num = num / 10;

}

int maxCount = 0;

int mostFrequent = 0;

for (int i = 0; i < count.length; i++) {

if (count[i] > maxCount) {

maxCount = count[i];

mostFrequent = i;

}

}

return mostFrequent;

}

Step-by-step explanation:

The mostFrequentDigit method takes in an integer num and returns the digit value that occurs most frequently in num.

1. The method first declares an array count of size 10 to keep track of the frequency of each digit (0-9).
2. Next, the method uses a while loop to repeatedly divide num by 10 and keep track of the remainder (which represents the last digit of num) in each iteration. For each iteration, the frequency of the last digit is incremented in the count array.
3. After the while loop, the method uses a for loop to iterate through the count array and keep track of the digit with the maximum frequency in the variables maxCount and mostFrequent.
4. Finally, the method returns the value of mostFrequent, which represents the digit that occurs most frequently in num.

So, for the example mostFrequentDigit(669260267), the method would return 6, since 6 is the digit that occurs the most frequently in the number.