/**
* 判断一个字符串是不是数字组成
* @param s 字符。
* @return
*/
public static boolean isDigits(String s){
if(s==null||s.length()==0)return false;
for(int i=0;i <s.length();i++){
if(!Character.isDigit(s.charAt(i)))return false;
}
return true;
}
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
/**
*@ author ajax_2003
*/
class Base {
public static void main(String[] args ) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
Map<String, Integer> map = new HashMap<String, Integer>();
String str = null;
while (!(str = in.readLine()).equalsIgnoreCase("quit")) {
System.out.println("请输入数据, 输入quit退出");
if (map.get(str) == null) {
map.put(str, 1);
}
else {
map.put(str, map.get(str) + 1);
}
}
for (Object key : map.keySet().toArray()) {
System.out.println(key + " 出现: " + map.get(key) + " 次");
}
}
}
用HashMap来解决
假设单词不存在跨行的,每个单词用,. ;分割
- import java.io.*;
- import java.util.*;
- public class FindWord {
- public void countNum()throws IOException{
- BufferedReader br=null;
- try{
- br= new BufferedReader(new FileReader("D://111.txt"));
- Map map= new HashMap();
- for(String s=br.readLine(); s!=null; s=br.readLine()){
- StringTokenizer st= new StringTokenizer(s,",. ;");
- while(st.hasMoreTokens()){
- String temp=st.nextToken();
- if(map.containsKey(temp)){
- map.put(temp, new Integer((Integer)map.get(temp)+1));
- }else{
- map.put(temp, new Integer(1));
- }
- }
- }
- for(Iterator it=map.entrySet().iterator();it.hasNext();){
- Map.Entry<String, Integer> entry=(Map.Entry<String, Integer>)it. next();
- System.out.println(entry.getKey()+"-->"+entry.getValue());
- }
- }catch(Exception e){
- e.printStackTrace();
- }finally{
- br.close();
- }
- }
- public static void main(String[] args)throws IOException{
- FindWord fw=new FindWord();
- fw.countNum();
- }
- }
依次读每一行,然后判断是否有单词
BufferedInputStream bis = .... // 这里打开文件
String key="单词";
String line; // 存储一行
int count = 0; // 表示第几行
while((line=bis.readLine())!=null)
{
n++;
if(line.indexOf(key)!=(-1)) // 找到了
System.out.println("在第" + n + "行找到了单词。");
}
* 计算递归的方法
* @param num
* @return
*/
public int Digui(int num){
if(num == 0){
num=1;
}else{
return num*Digui(num-1);
}
return num;
}