3.24作业

* 1、有如下map:
* Map<String,String> map = new HashMap<>();
* map.put(“aaa”,“111”);
* map.put(“bbb”,“111”);
* map.put(“ccc”,“111”);
* map.put(“ddd”,“222”);
* 使用3种方式，遍历并打印

        Set<String> keys=map.keySet();
        for (String key:
             keys) {
            System.out.println(key+"="+ map.get(key));
        }
//第二
        Collection co= map.keySet();
        Iterator<String> it = co.iterator();
        while (it.hasNext())
        {
            String key=it.next();
            System.out.println(key+"="+map.get(key));

        }
//第三种
     Set set=map.entrySet();
        Iterator it2= set.iterator();
        while (it2.hasNext())
        {
            Map.Entry<String,String>entry=(Map.Entry<String, String>) it2.next();
            System.out.println(entry.getKey()+"="+entry.getValue());
        }

2、定义集合List， 依次将1，2，3，4，5，6，7，8，9 添加到集合中 使用Collections中的方法：  打乱顺序  求最大值  求最小值  升序排列  交换位置  将该集合所有元素拷贝到另一个集合中并打印
    
    List<Integer>list=new ArrayList<>();
        for (int i = 1; i <10 ; i++) {
            list.add(i);
        }
        System.out.println(list);
        Collections.shuffle(list);
        System.out.println("随机:"+list);
        System.out.println("最大值:"+Collections.max(list));
 Integer min=Collections.max(list, new Comparator<Integer>() {
     @Override
     public int compare(Integer o1, Integer o2) {
         return o2 - o1;
     }
 });
        System.out.println("最小值："+min);
Collections.sort(list);
        System.out.println("升序排列："+list);
        Collections.swap(list,0,1);
        System.out.println(list);
   List<Integer>list1=new ArrayList<>();
        for (int i = 0; i < 10; i++) {
            list1.add((int)(Math.random()*100));
        }
        Collections.copy(list1,list);
        System.out.println(list1);
    }

        /**
         *     ArithmeticException类 - 算术异常
         *     ArrayIndexOutOfBoundsException类 - 数组下标越界异常
         *     NullPointerException - 空指针异常
         *     ClassCastException - 类型转换异常
         *     NumberFormatException - 数字格式异常
         *     OutOfMemoryError - 内存溢出错误
         */

        //ArithmeticException类 - 算术异常
        int a = 5 / 0;
        // ArrayIndexOutOfBoundsException类 - 数组下标越界异常
        String[] str = new String[2];
        str[2] = "5";
//NullPointerException - 空指针异常
        str = null;
        int aa = str.length;
// ClassCastException - 类型转换异常
        A1 a1 = new B1();
        C1 c1 = (C1) a1;
  // OutOfMemoryError 内存溢出错误
        String str2="a";
        for (int i = 0; i < 100000; i++) {
            str2=str2+str2;
        }
    }}
class A1 {
}

class B1 extends A1 {
}

class C1 extends B1 {
}

          * 4、分析以下需求，并用代码实现：
         * 	(1)统计每个单词出现的次数
         * 	(2)有如下字符串
         * 	"If you want to change your fate I think you
         * 	must come to the school to learn java"(用空格间隔)
         * 	(3)打印格式：
         * 		to=3
         * 		think=1
         * 		you=2
         */


String str="If you want to change your fate I think you must come to " +
             "the school to learn java";
     String []st=str.split(" ");
     Map<String,Integer>map1=new LinkedHashMap<>();
     for (String s:st
          ) {
boolean flag=map1.containsKey(s);
int index=0;
if (flag){
    index=map1.get(s);
}index++;
map1.put(s,index);
     }
     Set<String> set = map1.keySet();    //获取键的集合
     for(String s:set){
         System.out.println(s+"="+map1.get(s));
     }