zoukankan      html  css  js  c++  java
  • java中两个map比较

    /**
         * 用map的keySet()的迭代器(性能效率较低)
         * 
         */
        public  void compareMap1 (){
     
            Map<String, String> m1 = new HashMap<String, String>();//
            Map<String, String> m2 = new HashMap<String, String>();//
     
            Iterator<String> iter1 = m1.keySet().iterator();
     
            while (iter1.hasNext()) {
                String m1Key = (String) iter1.next();
                if (!m1.get(m1Key).equals(m2.get(m1Key))) {//若两个map中相同key对应的value不相等
                    //......
                }
            }
     
        }
        /**
         * 用map的entrySet()的迭代器(性能效率较高)
         */
        public void compareMap2(){
            Map<String, String> m1 = new HashMap<String, String>();
            Map<String, String> m2 = new HashMap<String, String>();
             
            Iterator<Entry<String, String>> iter1 = m1.entrySet().iterator();
            while(iter1.hasNext()){
                Map.Entry<String, String> entry1 = (Entry<String, String>) iter1.next();
           String m1value = entry1.getValue() == null?"":entry1.getValue();
                String m2value = m2.get(entry1.getKey())==null?"":m2.get(entry1.getKey());
                      
                if (!m1value.equals(m2value)) {//若两个map中相同key对应的value不相等
                    //其他操作...
                }
            }
        }
        /**
         * 用map的entrySet()的增强型for循环(性能效率较高)
         */
        public void compareMap3(){
             Map<String, String> m1 = new HashMap<String, String>();
             Map<String, String> m2 = new HashMap<String, String>();
              
             for(Map.Entry<String, String> entry1:m1.entrySet()){
                 String m1value = entry1.getValue() == null?"":entry1.getValue();
                 String m2value = m2.get(entry1.getKey())==null?"":m2.get(entry1.getKey());
                 if (!m1value.equals(m2value)) {//若两个map中相同key对应的value不相等
                    //其他操作...
                }
             } 
        }
  • 相关阅读:
    每周总结(第九周)
    每周总结(第七周)
    每周总结(第六周)
    成功案例和第五周总结
    结对编程和第四周总结
    每周总结(第三周)
    node.js爬取图片
    机器学习15 手写数字识别-小数据集
    机器学习13 14 深度学习-卷积
    机器学习12 垃圾邮件分类2(13)
  • 原文地址:https://www.cnblogs.com/shininguang/p/5294157.html
Copyright © 2011-2022 走看看