从彩票选号看HashSet和TreeSet

 

import java.util.HashSet;//无重复元素的集合

import java.util.TreeSet;

 

public class TestHashset {

       public static void main(String[] args) {

              HashSet hs1 = new HashSet();//生成hs1对象

              while (true) {

                     int temp = (int) (Math.random() * 33 + 1);//设置10以内的随机数，并把随机数保存在temp变量中

                     hs1.add(temp);//把生成的随机数添加到hs中

                     if (hs1.size() == 6)//使hs的容量保持在7以内

                            break;

              }

              System.out.println("33选6-->"+hs1);

             

              //TreeSet最大的作用是排序，付出的代价就是效率降低

              TreeSet ts1 = new TreeSet();

              while (true) {

                     int temp = (int) (Math.random() * 33 + 1);

                     ts1.add(temp);

                     if (ts1.size() == 6)

                            break;

              }

              System.out.println("33选6-->"+ts1);

             

             

              HashSet hs2 = new HashSet();

              while (true) {

                     int temp = (int) (Math.random() * 16 + 1);

                     hs2.add(temp);

                     if (hs2.size() ==1)

                            break;

              }

              System.out.println("16选1-->"+hs2);

             

       }

}