12504 - Updating a Dictionary

来源：互联网发布：单片机c语言编程编辑：程序博客网时间：2024/05/30 04:47

给出旧字典和新字典，输出字典的变化增加+、减少-、更改*。

思路：没有什么好说的，对于java来说，直接来个map存储两个字典，然后查找就可以了

package test;import java.util.ArrayList;import java.util.Collections;import java.util.HashMap;public class Test{static HashMap<String,Integer> newMap = new HashMap<String,Integer>();static HashMap<String,Integer> oldMap = new HashMap<String,Integer>();static ArrayList<String> change1 = new ArrayList<String>();static ArrayList<String> change2 = new ArrayList<String>();static ArrayList<String> change3 = new ArrayList<String>();public static void main(String[] args) {oldMap.put("c", 10);oldMap.put("a", 3);oldMap.put("b", 4);oldMap.put("f", 6);newMap.put("a", 3);newMap.put("c", 5);newMap.put("d", 10);newMap.put("ee", 4);for(String key:newMap.keySet()){if(!oldMap.containsKey(key)){//新增change1.add(key);}else{//修改if(oldMap.get(key)!=newMap.get(key)){change2.add(key);}}}//删除for(String key:oldMap.keySet()){if(!newMap.containsKey(key)){change3.add(key);}}if(change1.size()>0){System.out.println("+");Collections.sort(change1);System.out.println(change1);}if(change2.size()>0){System.out.println("*");Collections.sort(change2);System.out.println(change2);}if(change3.size()>0){System.out.println("-");Collections.sort(change3);System.out.println(change3);}}}

0 0