[Java]常用排序遍历克隆

import java.util.*;

public class test {
    public static void main(String[] args) {
        System.out.print("");
        //TreeMap(Key)逆序排列==================================================
        Map<Integer,Integer> map = new TreeMap<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2.compareTo(o1);
            }
        });

        //TreeMap(Value)逆序排列==================================================
        List<Map.Entry<Integer,Integer>> listMap = new ArrayList<>();
        Collections.sort(listMap, new Comparator<Map.Entry<Integer, Integer>>() {
            @Override
            public int compare(Map.Entry<Integer, Integer> o1, Map.Entry<Integer, Integer> o2) {
                return o2.getValue().compareTo(o1.getValue());
            }
        });

        //List逆序排列===============================================
        List<Integer> list = new ArrayList<>();
        Collections.reverse(list);

        //遍历HashMap  AND  TreeMap______No.1====================================
        Iterator iter = map.entrySet().iterator();
        while (iter.hasNext()){
            Map.Entry entry = (Map.Entry)iter.next();
            int key = (int)entry.getKey();
            int val = (int)entry.getValue();
        }
        //遍历HashMap  AND  TreeMap______No.2
        for(int key:map.keySet()){
            int val = map.get(key);
        }

        //队列==================================================================
        Queue<Integer> queue = new LinkedList<>();
        queue.add(1);//添加元素，超出队列长度，会报错
        queue.offer(2);//添加，错误处理，超出长度，返回false
        queue.remove();//返回队头值，队列空，报错
        queue.poll();//返回队头值，队列空，返回null

        //数组克隆(基本类型深克隆)================================================
        int[] a = new int[]{1,2,3};
            //No.1
        int[] a1 = new int[3];
        System.arraycopy(a,0,a1,0,3);//将a从0位置开始，复制到a1 [0,3)
            //No.2
        int[] a2 = Arrays.copyOf(a,3);
            //No.3
        int[] a3 = a.clone();
    }
}