zoukankan      html  css  js  c++  java
  • Java 中统计文件中出现单词的次数练习

     统计英文article.txt文件中出现hello这个单词的次数

     这个是article.txt文件内容 {

       

    hello The Royal Navy is trying hello to play hello down the problem,
    after first trying to hide it. It is clearly embarrassing.
    They have hello known about the problem for hello some time
    but they did not hello want it hello to get in the way of the
    commissioning hello ceremony hello in front hello of the Queen. hello

    }

    package ltb20180106;
    
    import java.io.*;
    
    
    public class WordCount  {
        
    private File f;    
    private BufferedReader br;
    private BufferedWriter bw;
    private String readline;
    private int start=0;
    private int end=0;
    private int count=0;
    
        public WordCount() {
            
            try {
                
                f=new File("D:\myRead\article.txt");
                br=new BufferedReader(new FileReader(f));
                bw=new BufferedWriter(new OutputStreamWriter(System.out));
                
                
                while((readline=br.readLine())!=null) {
                    
                        start=this.readline.indexOf("hello");
                         
                        if(start!=-1) { // 一行字符串中如果有hello出现就进行统计
                            
                            count++;
                            
                            end=this.readline.indexOf("hello",start+1);
                            
                            
                            
                            while(end!=-1) { //如果在这行中后续还有hello出现,继续统计,直到末尾没有hello出现为止。
                                
                                
                                count++; 
                                
                                System.out.print("[end:"+end+"]"+",");
                                
                                 end=this.readline.indexOf("hello",end+1);
                                 
                            }
                        }
                            
                         
                        bw.write(readline+"
    ");
                        
                        System.out.println("累计总共的次数:【"+count+"】"+"start:【"+start+"】");
                        
                    
                    
                    bw.flush();
                }
                
                System.out.println("单词hello在文章【"+f.getName()+"】中出现的次数为:【"+count+"】");
                
                bw.close();
                
            }catch(Exception e) {
                
                e.getMessage();
            }
            
            
        }
    
        public static void main(String[] args) {
            
               new WordCount();
        }
    
    }
     
  • 相关阅读:
    P1983 车站分级
    P1807 最长路
    P1347 排序
    P1073 最优贸易 (tarjan缩点+dp)
    最小费用最大流解决KM匹配问题
    CF191C Fools and Roads
    case when
    防呆机制
    DbCommand :执行超时已过期。完成操作之前已超时或服务器未响应。
    存储过程带参数和sqlcommand
  • 原文地址:https://www.cnblogs.com/ltb6w/p/8214623.html
Copyright © 2011-2022 走看看