Use Hashtable
所在版块：社会百科 发贴时间：2003-10-10 11:51  评分:

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
Convert the input value and the occurrence as Integer, use input value as Key and occurrence as Value, for every input, if you can find in the hashtable, increase the occurrence, if not, just put it in. The rest should be very easy.
.
欢迎来到华新中文网，踊跃发帖是支持我们的最好方法!

Put your OWN COOL signature here!
　相关帖子 我要回复↙ ↗回到正文
问！谁能帮我解这道java题？感谢···· － tonymmm 　2003-10-09 02:05 (415 bytes , 710reads )
Use Hashtable － 豫北闲人 　2003-10-10 11:51 (232 bytes , 332reads )
B+ tree better... － 今夜独自发呆 　2003-10-09 10:44 (0 bytes , 301reads )
If there is no memory limitation － 香陵居士 　2003-10-09 09:41 (111 bytes , 275reads )
Try his － 辰星 　2003-10-09 03:43 (361 bytes , 301reads )
Linear search is expensive － cigar 　2003-10-09 16:37 (0 bytes , 234reads )
But for his question it is ok. － 辰星 　2003-10-09 23:37 (35 bytes , 205reads )