Map例题:1 分析以下需求，并用代码实现： (1)统计每个单词出现的次数 (2)有如下字符串"If you want to change your fate I think you must c

/* 1 分析以下需求，并用代码实现：
(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*/

package com.wednesday.generic31;

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

public class Home01 {
public static void main(String[] args) {
	String st="If you want to change your fate I think you must come to the ujiuye to learn java";
	//将字符串以空格分隔,分别装入String数组
	String []sts=st.split(" ");
	TreeMap<String,Integer>map=new TreeMap<>();
	//遍历数组,每次将元素装入map,相同则在原有数目加一,否则设置初值一
	for(String string:sts){
	map.put(string, map.containsKey(string)?map.get(string)+1:1);	
	}
//遍历TreeMap	
	for(Entry<String,Integer> entry:map.entrySet()){
		System.out.println(entry.getKey()+"="+entry.getValue());	
	}
}
}