public static void output(String[] word,int[] wordFreq) {String Uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";String lowercase = "abcdefghijklmnopqrstuvwxyz";char arr[]= new char[100];String newword = "";//更新大小写后的单词int out;int ascll;int length;int serial=0;try{if(word.length!=wordFreq.length)System.out.println("Error handle!");else {//向默认文件"result.txt"中输出信息FileOutputStream fs =new FileOutputStream(new File("result.txt"));PrintStream p =new PrintStream(fs);//输出数组元素个数大于100时只输出前100个if(wordFreq.length>100) out=100;//否则按实际个数输出else out = wordFreq.length;for(int i=0;i<word.length;i++){newword = "";for(int j=0;j<word[i].length();j++){ascll=word[i].charAt(j);//把字符转换成对于的Ascll码//如果是大写转换成小写if(Uppercase.indexOf(ascll)!=-1){arr[j]=lowercase.charAt(Uppercase.indexOf(ascll));newword +=arr[j];}//如果是小写或其它字符则保持不变else{arr[j]=word[i].charAt(j);newword +=arr[j];}}word[i]=newword;//重置数组里的每个单词
         }//词频相等时排序处理    String temp = "";for(int i=0;i<wordFreq.length;i++)for(int j=i+1;j<wordFreq.length;j++){//在比较的两个单词中取最短的长度if(word[i].length()<word[j].length()) length = word[i].length();else length = word[j].length();//词频相等时进行排序if(wordFreq[i]==wordFreq[j]){for(;serial<length;serial++)//单词一位一位比较
                     {//当前一个单词的某位字母小于后一个单词的对应位字母时，不改变原顺序if(word[i].charAt(serial)<word[j].charAt(serial))break;//当前一个单词的某位字母等于后一个单词的对应位字母时，继续比较下一位字母else if(word[i].charAt(serial)==word[j].charAt(serial))continue;//当前一个单词的某位字母大于后一个单词的对应位字母时，交换两个单词的顺序else if(word[i].charAt(serial)>word[j].charAt(serial)){temp = word[i];word[i]=word[j];word[j]=temp;break;}}//当某一个单词里的字母已经比较完了仍没有结果if(serial==length){if(word[i].length()<word[j].length()) ;//单词长的放后面else {temp = word[i];word[i]=word[j];word[j]=temp;}}serial=0;}//词频不等时打破内层循环（该单词不会再与后面单词相等），从外层循环继续else break;}//最后的输出for(int i=0;i<out;i++){System.out.println(word[i]+" "+wordFreq[i]);p.println(word[i]+" "+wordFreq[i]);}}}catch(IOException e) {return;}}

public class wcoutputTest @Beforepublic void setUp() throws Exception {}@Testpublic void testOutput() {//fail("Not yet implemented");//测试用例String[] word1={"excuse","la","apple","Banana","lol","what","lala","s"};int[] wordFreq1={4,3,2,2,2,2,2,1};//调用被测试类的输出函数wcoutput.output(word1, wordFreq1);System.out.println("\n");//理想输出String[] expword1={"excuse","la","apple","banana","lala","lol","what","s"};//int[] expwordFreq={4,3,2,2,2,2,2,1};
        assertEquals(word1,expword1);}

 //词频相等时排序处理    String temp = "";for(int i=0;i<out;i++)for(int j=0;j<out;j++){//在比较的两个单词中取最短的长度if(word[i].length()<word[j].length()) length = word[i].length();else length = word[j].length();//词频相等时进行排序if(wordFreq[i]==wordFreq[j]){for(;serial<length;serial++)//单词一位一位比较
                     {//当前一个单词的某位字母小于后一个单词的对应位字母时，不改变原顺序if(word[i].charAt(serial)<word[j].charAt(serial))break;//当前一个单词的某位字母等于后一个单词的对应位字母时，继续比较下一位字母else if(word[i].charAt(serial)==word[j].charAt(serial))continue;//当前一个单词的某位字母大于后一个单词的对应位字母时，交换两个单词的顺序else if(word[i].charAt(serial)>word[j].charAt(serial)){temp = word[i];word[i]=word[j];word[j]=temp;break;}}//当某一个单词里的字母已经比较完了仍没有结果if(serial==length){if(word[i].length()<word[j].length()) ;//单词长的放后面else {temp = word[i];word[i]=word[j];word[j]=temp;}}serial=0;}//词频不等时打破内层循环（该单词不会再与后面单词相等），从外层循环继续else break;}