zfc.java

计算机网络编程技术作业中的字符串排序处理！程序比较简单！

import java.awt.*;
import java.util.*;
import java.applet.*;
import java.io.*;


public class zfc
{

public static void main(String[] args)throws IOException 
{
  BufferedReader keyin=new BufferedReader(new InputStreamReader(System.in));

String s;
String a[]=new String[100];
int i=0;
String temp;

System.out.println("输入字符串:");
  s=keyin.readLine();

StringTokenizer s1=new StringTokenizer(s," ");
System.out.println("字符串中单词的个数:"+s1.countTokens());
while(s1.hasMoreTokens())
{
  a[i++]=s1.nextToken();
}


for(int j=0;j<i;j++)
for(int n=1;n<i-j;n++)
{
if(a[n].compareToIgnoreCase(a[n-1])>0)
{
temp=a[n];
a[n]=a[n-1];
a[n-1]=temp;

}
}

for(int m=i-1;m>=0;m--)
System.out.println(a[m]);
}
}