zoukankan      html  css  js  c++  java
  • 第15周作业

    使用HashMap存储多个企鹅信息,然后统一使用Iterator进行遍历

    package homework;
    
    import java.util.HashMap;
    import java.util.Iterator;
    import java.util.Map;
    import java.util.Set;
    
    public class text {
        public static void main(String[] args) {
            Map<String,String> map=new HashMap();
            map.put("亚亚","Q妹");
            map.put("菲菲","Q妹");
            map.put("欧欧","Q仔");
            map.put("美美","Q妹");
            Set<String> keyset = map.keySet();
            Iterator<String> iter = keyset.iterator();
            while (iter.hasNext()){
                String key = iter.next();
                String value = map.get(key);
                System.out.println(key+"	"+value);
            }
    
    
        }
    
    
    }

    在上机3的基础上,为企鹅添加一个编号,并作为键存储多个企鹅信息到应用泛型的HashMap集合 使用Iterator、foreach语句进行遍历

    package homework;
    
    import java.util.HashMap;
    import java.util.Iterator;
    import java.util.Map;
    import java.util.Set;
    
    public class text {
        public static void main(String[] args) {
            Map<String,String> map=new HashMap();
            map.put("亚亚","Q妹");
            map.put("菲菲","Q妹");
            map.put("欧欧","Q仔");
            map.put("美美","Q妹");
            Set<String> keyset = map.keySet();
            Iterator<String> iter = keyset.iterator();
            while (iter.hasNext()){
                String key = iter.next();
                String value = map.get(key);
                System.out.println(key+"	"+value);
            }
    
            System.out.println("使用foreach遍历");
            for (String key : keyset) {
                String value = map.get(key);
                System.out.println(key+"	"+value);
            }
        }
    
    
    }
  • 相关阅读:
    修改注释的风格
    PHP in_array
    PHP end
    PHP each
    GitHub和SourceTree入门教程
    面试题解析(不定时更新)
    Container With Most Water
    Minimum Path Sum
    Generate Parentheses
    Unique Paths
  • 原文地址:https://www.cnblogs.com/jiming123/p/13138848.html
Copyright © 2011-2022 走看看