(1)统计每个单词出现的次数 (2)有如下字符串"If you want to change your fate......"(3)打印格式： to=3

import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeMap;

/*(1)统计每个单词出现的次数
(2)有如下字符串"If you want to change your fate I think you must come to the ujiuye to learn java"(用空格间隔)
(3)打印格式：
to=3
   think=1
   you=2*/
public class Demo_2 {

	public static void main(String[] args) {
		/*
		 * 将字符串通过split()存放到数组中
		 * 创建TreeMap(),对数组遍历
		 * 单词存在集合中,取出value+1,再放进去
		 * 不在集合中,加入集合,value=1
		*/
		String str = "If you want to change your fate I think you must come to the ujiuye to learn java";
		//将每一个单词存放到数组中
		String[] sa = str.split(" ");
		Map<String,Integer> m = new TreeMap<String,Integer>();
		for(String i : sa) {
			//判断单词是否在集合中
			if(m.containsKey(i)) {
				Integer value = m.get(i);
				//map中键相同,新的会将旧的覆盖
				m.put(i, value+1);
			}else {
				m.put(i, 1);
			}
		}
		//用keySet()进行遍历
		//m1(m);
		//用entrySet()进行遍历
		Set<Entry<String, Integer>> entrySet = m.entrySet();
		Iterator<Entry<String, Integer>> iterator = entrySet.iterator();
		while(iterator.hasNext()) {
			Entry<String, Integer> kv = iterator.next();
			String k = kv.getKey();
			Integer v = kv.getValue();
			System.out.println(k+"="+v);
		}
	}
	private static void m1(Map<String, Integer> m) {
		Set<String> key = m.keySet();
		Iterator<String> iterator = key.iterator();
		while(iterator.hasNext()) {
			String k = iterator.next();
			Integer integer = m.get(k);
			System.out.println(k+"="+integer);
		}
	}
}