importjava.util.ArrayList;importjava.util.List;/*** Created by yanfazhongxin on 2020-04-22.

 * 守护线程*/
public class加密解密 {public static voidmain(String[] args) {//两条线程谁启动先没有影响
        Thread t2 = new Thread(newLog_thread());

        t2.setDaemon(true);//设定为 守护线程
t2.start();

        Thread t1= new Thread(newDecode());

        t1.start();



    }

}class Decode implementsRunnable {static List<String> list = new ArrayList<>();

    String password= String.valueOf(random(4));public char[] random(intindex) {char[] re = new char[index];

        Math.random();for (int i = 0; i < index; i++) {//指定随机范围 : 64-90
            re[i] = (char) ((Math.random() * 26 + 64));

        }returnre;



    }





    @Overridepublic voidrun() {

        System.out.println("本次随机密码是:" +password);boolean cnt = true;while(cnt) {

            String str= String.valueOf(random(4));if(str.equals(password)) {

                System.out.println("匹配密码正确是:" +password);

                list.add(str);

                cnt= false;

            }else
                //System.out.println(str+" 匹配失败");
list.add(str);

        }



    }



}class Log_thread implementsRunnable {

    @Overridepublic voidrun() {

        System.out.println(" Log_thread implements");//for (int i = 0; i < Decode.list.size(); i++) {
        while(true){if ((Decode.list == null)||(Decode.list.size()<1)) {try{

                    Thread.sleep(50);

                }catch(InterruptedException e) {

                    e.printStackTrace();

                }

            }elseSystem.out.println("  匹配的密码可能是:" + Decode.list.remove(0));

        }

    }

}

packagecom.eos.wool.test2;import java.util.*;/*** Created by CLP on 2020-06-17.*/
public classPriorityQueueTest {public static List<Integer>insertSort() {

        Queue<Integer> queue = new PriorityQueue<Integer>(12);

        List<Integer> list = new ArrayList<Integer>();

        Random random= newRandom();intaa;for (int i = 0; i < 17; i++) {

            aa=random.nextInt(100);

            System.out.println(aa);

            queue.add(newInteger(aa));

        }while(!queue.isEmpty()){

            list.add(queue.poll());

        }//左右输出 个数不全；因为poll一次就会删除，所以size会变化，和list一般需要逆序删除一样。//for (int i = 0; i < queue.size(); i++) {//list.add(queue.poll());//}
System.out.println(list.toString());returnlist;



    }public  static voidmain(String[] args){



        System.out.println(Arrays.toString(insertSort().toArray()));

    }

}