【List<Map<String,String>>】循环遍历,获取key,value(35)

直接上代码:

package com.itheima;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
/*
 * List<Map<String, String>>练习
 */
public class ListMapTest {
 public static void main(String[] args) {
  
  List<Map<String, String>> list = new ArrayList<Map<String, String>>();
  
  Map map1 = new HashMap();
  map1.put("001", "西安");
  map1.put("002", "宝鸡");
  Map map2 = new HashMap();
  
  map2.put("01", "北京");
  map2.put("02", "石家庄");
  
  list.add(map1);
  list.add(map2);
  
  for (Map<String, String> map : list) {
   System.out.println(map);
  }
  System.out.println("1-----------------------");
  for (Map<String, String> map : list) {
   for(String s:map.keySet()) {
    String key = s;
    String value = map.get(key);
    System.out.println("key:"+key);
    System.out.println("value:"+value);
   }
  }
  
  System.out.println("2-----------------------");
  for (int i = 0; i < list.size(); i++) {
            Map<String, String> map = list.get(i);
            Iterator it = map.keySet().iterator();
            while (it.hasNext()) {
                String str = (String) it.next();
                System.out.print("key:"+str+"\t");
                System.out.println("value:"+map.get(str));
            }
        }
  
  System.out.println("3-----------------------"); 
   for (Map<String, String> map : list) {
             for (Map.Entry<String, String> m : map.entrySet()) {
                 System.out.print("key:"+m.getKey() + "    ");
                 System.out.println("value:"+m.getValue());
             }
         }
  System.out.println("4-----------------------"); 
  
 }
}

测试输出:

{001=西安, 002=宝鸡}
{01=北京, 02=石家庄}
1-----------------------
key:001
value:西安
key:002
value:宝鸡
key:01
value:北京
key:02
value:石家庄
2-----------------------
key:001	value:西安
key:002	value:宝鸡
key:01	value:北京
key:02	value:石家庄
3-----------------------
key:001    value:西安
key:002    value:宝鸡
key:01    value:北京
key:02    value:石家庄
4-----------------------
  • 0
    点赞
  • 5
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
java Map 遍历方法 Map map = new HashMap(); Iterator it = map.entrySet().iterator(); while (it.hasNext()) { Map.Entry entry = (Map.Entry) it.next(); Object key = entry.getKey(); Object value = entry.getValue(); } Map map = new HashMap(); Iterator it = map.entrySet().iterator(); while (it.hasNext()) { Map.Entry entry = (Map.Entry) it.next(); Object key = entry.getKey(); Object value = entry.getValue(); } JDK1.5中,应用新特性For-Each循环 Java代码 Map m = new HashMap(); for(Object o : map.keySet()){ map.get(o); } Map m = new HashMap(); for(Object o : map.keySet()){ map.get(o); } 返回的 set 中的每个元素都是一个 Map.Entry 类型。 private Hashtable<String, String> emails = new Hashtable<String, String>(); 另外 我们可以先把hashMap 转为集合Collection,再迭代输出,不过得到的对象 //方法一: 用entrySet() Java代码 Iterator it = emails.entrySet().iterator(); while(it.hasNext()){ Map.Entry m=(Map.Entry)it.next(); logger.info("email-" + m.getKey() + ":" + m.getValue()); } Iterator it = emails.entrySet().iterator(); while(it.hasNext()){ Map.Entry m=(Map.Entry)it.next(); logger.info("email-" + m.getKey() + ":" + m.getValue()); } // 方法二:jdk1.5支持,用entrySet()和For-Each循环() Java代码 for (Map.Entry<String, String> m : emails.entrySet()) { logger.info("email-" + m.getKey() + ":" + m.getValue()); } for (Map.Entry<String, String> m : emails.entrySet()) { logger.info("email-" + m.getKey() + ":" + m.getValue()); } // 方法三:用keySet() Java代码 Iterator it = emails.keySet().iterator(); while (it.hasNext()){ String key; key=(String)it.next(); logger.info("email-" + key + ":" + emails.get(key)); } Iterator it = emails.keySet().iterator(); while (it.hasNext()){ String key; key=(String)it.next(); logger.info("email-" + key + ":" + emails.get(key)); } // 方法五:jdk1.5支持,用keySEt()和For-Each循环 Java代码 for(Object m: emails.keySet()){ logger.info("email-" + m+ ":" + emails.get(m)); } Map aa = new HashMap(); aa.put("tmp1", new Object()); //追加 替换用同样的函数. aa.remove("temp1"); //删除 for (Iterator i = aa.values().iterator(); i.hasNext(); ) { Object temp = i.next(); } //遍历 for(Object m: emails.keySet()){ logger.info("email-" + m+ ":" + emails.get(m)); } Map aa = new HashMap(); aa.put("tmp1", new Object()); //追加 替换用同样的函数. aa.remove("temp1"); //删除 for (Iterator i = aa.values().iterator(); i.hasNext(); ) { Object temp = i.next(); } //遍历 来个完整的,包含TreeSet的元素内部排序的 Java代码 public static void main(String[] args) { ArrayList<String> list = new ArrayList<String>(); HashMap<Object,Object> hash = new HashMap<Object,Object>(); TreeMap<Object,Object> treeMap = new TreeMap<Object,Object>(); list.add("a"); list.add("b"); list.add("c"); hash.put(3, 3); hash.put(4, 4); hash.put(5, 5); hash.put(6, 6); hash.put(1, 1); hash.put(2, 2); treeMap.put(1, 1); treeMap.put(2, 2); treeMap.put(3, 3); treeMap.put(4, 4); treeMap.put(5, 5); treeMap.put(6, 6); //list遍历 for(String m: list){ System.out.println(m); } // hashmap entrySet() 遍历 for(Map.Entry<Object,Object> m: hash.entrySet()){ System.out.println(m.getKey()+"---"+m.getValue()); } //hashmap keySet() 遍历 for(Object m: hash.keySet()){ System.out.println(m+"---"+hash.get(m)); } // treemap keySet()遍历 for(Object m: treeMap.keySet()){ System.out.println(m+"---"+treeMap.get(m)); } }

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

KevinDuc

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值