实验二

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
public class demo{
private Map<String, Integer> wordsMap;
public demo(String strWords){
wordsMap=this.getArray(strWords);
}

public Map<String,Integer>getArray(String strWords){
String[] words_Array =strWords.split(" ");
Map<String,Integer>words_Map=new HashMap<String,Integer>();

int arrLength=words_Array.length;
for(int i=0;i<arrLength;i++){
if(!words_Map.containsKey(words_Array[i])){
words_Map.put(words_Array[i],1);
}
}
return words_Map;
}


public void OutputResult(){
Set<String> s=wordsMap.keySet();
Iterator i= s.iterator();
while(i.hasNext()){
Object o=i.next();
System.out.println(o+"出现了次数为"+wordsMap.get(o));
}
}
public static void main(String[] args){
demo d=new demo("hello word word");
d.OutputResult();
}
}

 

public class demo {

public static void main(String[] args) {
// TODO Auto-generated method stub

String str = "how are you";
String strs[] = str.split(" ");
StringBuffer result = new StringBuffer();
for(int i = strs.length-1; i >= 0; i--){
System.out.println(strs[i]);
result .append(" "+strs[i]);
}
System.out.println("倒序:"+result );
}

}

 

posted on 2016-04-29 14:53  echo1561  阅读(102)  评论(0编辑  收藏  举报