问!谁能帮我解这道java题?感谢····
登录 | 论坛导航 -> 华新鲜事 -> 社会百科 | 本帖共有 7 楼,当前显示第 5 楼 : 从楼主开始阅读 : 本帖树形列表 : 返回上一页
作者:cigar (等级:2 - 初出茅庐,发帖:296) 发表:2003-10-09 16:37:49  5楼 
Try hisImplement 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.
Linear search is expensive
Put your OWN COOL signature here!
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!原文 / 传统版 / WAP版只看此人从这里展开收起列表

本帖共有 7 楼,当前显示第 5 楼,本文还有 N-1 层楼,要不你试试看:点击此处阅读更多 >>



请登录后回复:帐号   密码