Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

java实现,不知道哪错了,大牛指出,多谢!!!!

Posted by gostopsb at 2006-12-02 18:11:23 on Problem 2945
import java.util.*;
public class P2945
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		// TODO 自动生成方法存根
        Scanner sc=new Scanner(System.in);
        
        int n=sc.nextInt();
        int m=sc.nextInt();
        String input="";  //每行输入
        HashMap<String,Integer> hm=new HashMap<String,Integer>();//字符串及其出现次数对
       
       while(!(n==0&&m==0))
       {
    	   int [] count=new int[n];//表示重复次数的人的个数,例如count[1]表示重复一次的字符串的个数
        for(int i=0;i<n;i++)
        {
        	input=sc.next();
        	if(!hm.containsKey(input))
        	{
        		hm.put(input, 0);
        	}
        	else
        	{
        	 Integer value=	hm.get(input);
        	 value++;
        	 hm.remove(input);
        	 hm.put(input, value);
        	}
        
        }
        Set s=hm.keySet();
        Iterator it=s.iterator();
        while(it.hasNext())
        {
        	count[hm.get(it.next())]++;
        }
        
        for(int i=0;i<n;i++)
        {
        	System.out.println(count[i]);
        }
        n=sc.nextInt();
        m=sc.nextInt();
       }
	}

}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator