问!谁能帮我解这道java题?感谢····write a program that reads an unspecified number of integers and finds the one that has the most occurrences. your input ends when the input is -1.for example, if you entered 2 3 40 3 5 4 7 3 3 2 -1, the number 3 occurred most often. enter one number at a time. if several numbers have the most occurrences, all of them should be reported. for example, if both 9 and 3 occur the same times, both should be reported.
Try his
Implement in Linked List, with each node containing a number and its frequency.
Whenever a number is input, it tries to find it if it's in the List.
If so, add its frequency by 1.
If not, add a tail containing the number into the Linked List and set its frequency to 1.
At the end, scan the whole List and try to find out the nodes containing max frequency.
Whenever a number is input, it tries to find it if it's in the List.
If so, add its frequency by 1.
If not, add a tail containing the number into the Linked List and set its frequency to 1.
At the end, scan the whole List and try to find out the nodes containing max frequency.
And you are here, now, always.
People are not memories that you can put into words. They live.