zoukankan      html  css  js  c++  java
  • java中遍历MAP的几种方法

    java中遍历MAP的几种方法 
    Java代码 
    Map<String,String> map=new HashMap<String,String>();    
    map.put("username", "qq");    
    map.put("passWord", "123");    
    map.put("userID", "1");    
    map.put("email", "qq@qq.com");   
    Map<String,String> map=new HashMap<String,String>(); 
    map.put("username", "qq"); 
    map.put("passWord", "123"); 
    map.put("userID", "1"); 
    map.put("email", "qq@qq.com"); 
    第一种用for循环 
    Java代码 

    for(Map.Entry<String, String> entry:map.entrySet()){    
         System.out.println(entry.getKey()+"--->"+entry.getValue());    
    }   
    for(Map.Entry<String, String> entry:map.entrySet()){ 
              System.out.println(entry.getKey()+"--->"+entry.getValue()); 


    第二种用迭代 
    Java代码 

    Set set = map.entrySet();         
    Iterator i = set.iterator();         
    while(i.hasNext()){      
         Map.Entry<String, String> entry1=(Map.Entry<String, String>)i.next();    
         System.out.println(entry1.getKey()+"=="+entry1.getValue());    
    }   
    Set set = map.entrySet();     
    Iterator i = set.iterator();     
    while(i.hasNext()){  
        Map.Entry<String, String> entry1=(Map.Entry<String, String>)i.next(); 
        System.out.println(entry1.getKey()+"=="+entry1.getValue()); 

    用keySet()迭代 
    Java代码 

    Iterator it=map.keySet().iterator();    
    while(it.hasNext()){    
         String key;    
         String value;    
         key=it.next().toString();    
         value=map.get(key);    
         System.out.println(key+"--"+value);    
    }   
    Iterator it=map.keySet().iterator(); 
    while(it.hasNext()){ 
        String key; 
        String value; 
        key=it.next().toString(); 
        value=map.get(key); 
        System.out.println(key+"--"+value); 


    用entrySet()迭代 
    Java代码 

    Iterator it=map.entrySet().iterator();           
    System.out.println( map.entrySet().size());    
    String key;           
    String value;    
    while(it.hasNext()){    
            Map.Entry entry = (Map.Entry)it.next();           
            key=entry.getKey().toString();           
            value=entry.getValue().toString();           
            System.out.println(key+"===="+value);                     
    }   

  • 相关阅读:
    POJ1239
    HDU 2829 四边形不等式优化
    返回数字二进制的最高位位数o(n)
    矩阵快速幂 模板
    HDU4718 The LCIS on the Tree(LCT)
    HDU4010 Query on The Trees(LCT)
    HDU3487 Play With Chains(Splay)
    CF444C DZY Loves Colors
    HDU4836 The Query on the Tree(树状数组&&LCA)
    HDU4831&&4832&&4834
  • 原文地址:https://www.cnblogs.com/zhujiabin/p/5131045.html
Copyright © 2011-2022 走看看