test.java.bak

用二叉树实现统计字符出现频率算法 JAVA实现

//主类，

import java.io.*;

class test  
{
	public static void main(String[] args) 
	{
		String st = null;
		String str = null;
		System.out.println( "请输入句子,幕桦同学:" );
		binaryTree tree = new binaryTree();
		BufferedReader br =  new BufferedReader( new InputStreamReader( System.in ) );
		try
		{
			 st = br.readLine();
			 str =  rrmoveAllSpace( st );  //去掉空格
		}
		catch( IOException e )
		{
			System.out.println( e.toString() );
		}
		char c;
		for( int i = 0; i < str.length() ; i++ )
		{
			c = str.charAt( i );
			tree.insert( tree.getRoot(), c );
		}
		//开始打印
		tree.print( tree.getRoot() );

	}

	public static String rrmoveAllSpace(String str)
	{
		String tmpstr=str.replace(" ","");//用""取代" ",则删除了空格

		return tmpstr;
	} 

}