1.建文件夾tools
建Java Demo01

public class Demo01 {
    public static void main(String[] args) {
        String str[] = { "中文", "計算機", "ABC", "123", "qq@qq.com" };
        List<String> list = Arrays.asList(str); // 1 Arrays.asList() 將數(shù)組轉(zhuǎn)換成列表
        System.out.println(list);

        // 2 將數(shù)組轉(zhuǎn)換成數(shù)組列表（鏈?zhǔn)搅斜恚? new ArrayList<>(Arrays.asList(str))
        ArrayList<String> alist = new ArrayList<>(Arrays.asList(str));
        LinkedList<String> llist = new LinkedList<>(Arrays.asList(str));
        alist.remove("ABC");
        llist.add("1321123");
        System.out.println(alist);
        System.out.println(llist);

        // 3 將列表轉(zhuǎn)換成數(shù)組  列表.toArray();
        Object[] str2 = alist.toArray();
        for ( Object o : str2 ) {
            System.out.print(o +" ");
        }
        System.out.println();
        Object[] str3 = llist.toArray();
        for ( Object o : str3 ) {
            System.out.print(o + " ");
        }


    }
}

建Java Demo02

public class Demo02 {
    public static void main(String[] args) {
        String str[] = { "中文", "計算機", "ABC", "123", "qq@qq.com" ,"ABC" };
        // 1 將數(shù)組轉(zhuǎn)換成集合 new HashSet<>(Arrays.asList(str));
        HashSet<String> set = new HashSet<>(Arrays.asList(str));
        System.out.println(set);
        // 2 將集合再轉(zhuǎn)換成數(shù)組  toArray();
        Object[] arr = set.toArray();
        for( Object a : arr ) {
            System.out.println(a);
        }


    }
}

建Java Demo03

public class Demo03 {
    public static void main(String[] args) {
        HashMap<String, String> map = new HashMap<>();
        map.put("1", "A");
        map.put("2", "B");
        map.put("3", "C");
        // 1 keySet()
        Set<String> keys = map.keySet();
        System.out.println(keys);
        // 2 把set轉(zhuǎn)換成其他集合
        ArrayList<String> alistkeys = new ArrayList<>(keys);
        System.out.println(alistkeys);
        // 3 取出map的值 value()
        Collection<String> v = map.values();
        System.out.println(v);
        // 4 把值轉(zhuǎn)換成其他的集合 new LinkedList<>(v)
        LinkedList<String> llistv = new LinkedList<>(v);
        System.out.println(llistv);


    }
}

建Java Demo04

public class Demo04 {
    public static void main(String[] args) {
        HashMap<Integer, String> map = new HashMap<>();
        for( int i = 0 ; i < 200000 ; i ++ ) {
            map.put(i , "haha"+ i ) ;
        }
        // 迭代器 減少資源占用
        Iterator<Map.Entry<Integer, String>> iterator = map.entrySet().iterator();
        while ( iterator.hasNext() ) {
            Map.Entry<Integer, String> next = iterator.next();
            System.out.println(next);
        }





    }
}

建Java Demo05

public class Demo05 {
    public static void main(String[] args) {
        ArrayList nums = new ArrayList<>();
        nums.add(2);
        nums.add(0);
        nums.add(-5);
        nums.add(0);
        nums.add(3);

        // 1 排序 sort
        Collections.sort(nums);
        System.out.println(nums);
        // 2 反轉(zhuǎn) reverse
        Collections.reverse(nums);
        System.out.println(nums);
        // 3 混洗
        Collections.shuffle(nums);
        System.out.println(nums);
        // 4 求最大小值
        System.out.println(Collections.max(nums));
        System.out.println(Collections.min(nums));
        // 5 替換
        Collections.replaceAll(nums , 0 ,100);
        System.out.println(nums);
        // 6 求頻率
        System.out.println(Collections.frequency(nums,100));
        // 7 二分搜索 忱反，使用的條件是集合是有序的
        Collections.sort(nums);
        System.out.println(nums);
        int i = Collections.binarySearch(nums, 3);
        System.out.println("位置" + i) ;




    }
}