解析地图，list

解析map，list
//解析一个map
for(Iterator iter = noticeMap.keySet().iterator(); iter.hasNext(); ){
Entry entry = (Entry) iter.next();
String key =entry .getKey().toString();
      String value=entry.getValue().toString(); msgToJsp.append(entry.getKey().toString()).append(",")
.append(entry.getValue().toString());
}

//遍历map
遍历K-V
/* 第一种: entryset只遍历一次:它把key和value放到entry */
Map map = getMap();
Iterator iter = map.entrySet().iterator();
while (iter.hasNext()) {
    Map.Entry entry = (Map.Entry) iter.next();
    Object key = entry.getKey();
    Object val = entry.getValue();
}//高效,使用此种方式

/* 第二种: keySet实际遍历了2次：
转为iterator时候一次；
取key对应value又一次。*/
Map map = getMap();
Iterator iter = map.keySet().iterator();
while (iter.hasNext()) {
    Object key = iter.next();
    Object val = map.get(key);
}//效率低


Map<string> map = new HashMap<string>();
map.put("id1", "wang");
map.put("id2", "li");

//map的遍历方法1
// Set<string> set = map.keySet();
// for(String s:set){
// System.out.println(s + "," + map.get(s));
// }

//map的遍历方法2
// Set<map.entry string>> entryseSet = map.entrySet();
// for(Map.Entry<string string> entry:entryseSet){
// System.out.println(entry.getKey()+","+entry.getValue());
// }

//map的遍历方法3
Iterator<string> it = map.keySet().iterator();
while(it.hasNext()){
System.out.println(map.get(it.next()));
}

//map的遍历方法4
// Iterator it = map.values().iterator();
// while(it.hasNext()){
// String val = (String)it.next();
// System.out.println(val);
// }
} </string></string></map.entry></string></string></string>