1.　　分别使用Vector、Hashtable、Stack，ArrayList、LinkedList和HashSet作为容器类，实现以下要求：

(1)　　向容器中添加1,000,000个随机整数。

(2)　　遍历容器中的所有元素。

(3)　　随机产生100,000个整数，在容器中查找这些整数。

(4)　　随机产生100个整数，从容器中删除这些整数。

(5)　　统计完成以上各个操作需要的时间。

比较一下不同操作在不同数据结构下的性能差异。程序文件命名为Exe5_1.java。

-51 respectively using Vector, Hashtable, Stack, ArrayList, LinkedList and HashSet as the container class, to achieve the following requirements:



( 1) are added to the container 1000000 random integers.



( 2) to traverse all the elements in the container.



( 3) 100000 randomly generated integer, in the container to find these integers.



( 4) random produces 100 integers, is removed from the container of these integers.



( 5) complete the statistics above each operation requires time.



Compare the different operating at different data structure performance differences. Program file named Exe5_1.java