Vector:元老级别的集合,底层是动态数组,线程安全的集合
public class Demo03 {
public static void main(String[] args) {
Vector vector = new Vector();
vector.addElement("a");
vector.addElement("b");
vector.addElement("c");
//遍历数据
Enumeration elements = vector.elements();
while (elements.hasMoreElements()){
System.out.println(elements.nextElement());
}
}
}
Stack:模拟栈的集合,特点是用完即删,后进先出(LIFO)
public class Demo04 {
public static void main(String[] args) {
Stack stack = new Stack();
stack.push("a");
stack.push("b");
stack.push("c");
/*System.out.println("获取对象前:"+stack.size());
//1.获取栈顶的对象
//2.删除栈顶的对象
Object obj = stack.pop();
System.out.println("获取的对象:"+obj);
System.out.println("获取对象后:"+stack.size());*/
while(stack.size() != 0){
System.out.println("获取的对象:"+stack.pop());
}
}
}
Queue:用完即删,先进先出(FIFO)
public class Demo05 {
public static void main(String[] args) {
Queue queue = new LinkedList();
queue.add("张三");
queue.add("李四");
queue.add("王五");
queue.add("赵六");
queue.add("田七");
System.out.println(queue.size()+"个人去打饭");
System.out.println("打完了,"+queue.poll()+"出来了");
System.out.println("里面就剩"+queue.size()+"人");
}
}