TreeSet 实现排序接口 安全删除的例程

import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeSet;
//程序启动后, 可以从键盘输入接收多个整数, 直到输入quit时结束输入. 把所有输入的整数倒序排列打印.
public class TestDemo {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
     Scanner sc = new Scanner(System.in);
     TreeSet<Integer> als = new TreeSet<>(new Comparator<Integer>() {
       //实现排序接口
        @Override
        public int compare(Integer o1, Integer o2) {
            // TODO Auto-generated method stub
                   int num = o2.compareTo(o1);
            return num == 0 ? 1 : num;
        }
    });
     String nums = null;
     while(true) {
         System.out.println("请录入数据:...");
         nums = sc.nextLine();
         if("quit".equals(nums)) {
             break;
         }else {
             try {
                int num = Integer.parseInt(nums);
                als.add(num);
            } catch (Exception e) {
                System.out.println("恁录入的不是整数,请重新录入...");
            }
         }

     }
     Iterator<Integer> it = als.iterator();
     while(it.hasNext()) {
         int tempv = it.next();
         if(444==tempv) {
             it.remove(); //不喜欢444,将其删除
         }else {
             System.out.print(tempv+" "); 
         }

     }
    }

}