获取文章中的字母个数 和单词个数

 

 

获取文章中各个字母个数的代码 

1 package text1; 
2 import java.io.File; 
3 import java.io.FileReader; 
4 import java.io.IOException; 
5 import  java.text.DecimalFormat;
6 public class Text{

public static void main(String[] args) {
   double num=0;
   int[] freArray = new int[52];
   char[] charArray = loadCharArrayFromFileName("D://article//Harry Potter and the Sorcerer's Stone.txt");
   computeFrequency(freArray, charArray);
   for(int i = 0; i < freArray.length; i++) {
      num+=freArray[i];
   }
   System.out.println(num);
   DecimalFormat df = new DecimalFormat("######0.00");
   for (int i = 0; i < freArray.length/2; i++) {
      System.out.println(((char) ('a' + i)) + ":" + freArray[i]+" "+df.format((100*freArray[i])/num)+"%");
   }
   for (int i = 26; i < freArray.length; i++) {
      System.out.println(((char) ('A' + i-26)) + ":" + freArray[i]+" "+df.format((100*freArray[i])/num)+"%");

   }
}26 public static void computeFrequency(int[] freArray, char[] charArray) {
   for (int i = 0; i < charArray.length; i++) {
      if (charArray[i] >= 'A' && charArray[i] <= 'Z') {
         freArray[charArray[i] - 'A'+26]++;
      }
      if (charArray[i] >= 'a' && charArray[i] <= 'z') {
         freArray[charArray[i] - 'a']++;
      }
   }
}
public static char[] loadCharArrayFromFileName(String name) {
   char[] charArray = new char[5000000];
   File file = new File(name);
   FileReader fr = null;
   try {
      fr = new FileReader(file);
      fr.read(charArray);
      return charArray;
   } 
      catch (IOException e) {
      e.printStackTrace();
   } finally {
   try {
      fr.close();
   } catch (IOException e) {

      e.printStackTrace();
    }
   }
  return null;
}

}

程序运行截图：

 

 

 

获取文章中各个单词个数，并输出前n个最常用单词和所有单词的代码：

 

package text1;

import java.io.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Date;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
import java.util.stream.Collectors;


public class Test2 {

//找到目标文件,创建字符输入流对象，
public static Reader findFile(){
   File f=new File("D://article//Harry Potter and the Sorcerer's Stone.txt");
   Reader in=null;
   try{
      in=new FileReader(f);
   }catch(IOException e){
      e.printStackTrace();
   }
   return in;
}
//缓存流
public static BufferedReader inputPipe(Reader in){
   BufferedReader br=null;
   br=new BufferedReader(in);
   return br;
}
//读取文章内容
public static String readAll(BufferedReader br,Reader in){
   String str;
   Map<String,Integer> map=new HashMap<>();
   StringBuilder words=null;
   String allwords=null;
   try {
      StringBuilder sb = new StringBuilder();
   while ((str = br.readLine()) != null) {

      words = sb.append(str);
      allwords=sb.toString();
   }
   br.close();
   in.close();
   }catch(IOException e){
      e.printStackTrace();
   }

   return allwords;
}

public static void spiltAndCount(String allwords, Map<String,Integer> map) {
   String regex = "\\W+";
   String[] words = allwords.split(regex);//截获单词，并存放到数组中
   for (int i = 0; i < words.length; i++) {
      if (map.containsKey(words[i])) {
      map.put(words[i], map.get(words[i])+1);
   } else {
      map.put(words[i], 1);
   }
   }
   Set<String> keys = map.keySet();

   System.out.println("总单词数："+words.length);
   List<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>(map.entrySet()); //转换为list
   //按照 value值排序
   Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
   @Override
   public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
      return o2.getValue().compareTo(o1.getValue());
   }
   });
   int n;
   n=list.size();
   /*System.out.println("你想获取前几个单词？");

   Scanner cin=new Scanner(System.in);
   n=cin.nextInt();
   */
   for (int i = 0; i < n; i++) {
      System.out.println(list.get(i).getKey() + ": " + list.get(i).getValue());
   } 

}


public static void main(String[] args) {
   long star =System.currentTimeMillis();

   Map<String,Integer> map=new HashMap<>();
 97    Reader in= Test2.findFile();
   BufferedReader br=Test2.inputPipe(in);
   String allwords= Test2.readAll(br,in);
   Test2.spiltAndCount(allwords, map);
   long end=System.currentTimeMillis();

}
}

  程序运行截图：