关于集合的总结

import java.util.*;//导入所有的包

//关于集合

public class firstClass {

public static void main(String[] args) {

//集合的种类

/*List<String> list1 = new ArrayList<String>();

List<String> list2 = new LinkedList<String>();

List<String> list3 = new Vector<String>();

List<String> list1 = new Stack<String>();

Stack<String> list2 = new Stack<String>();

list2.push(item)

//将元素推入到list这个栈中，将元素追加到数组的末尾

list2.peek(item)

//在栈顶取元素，不删除，会返回到末尾的元素

list2.pop(item)

//在栈顶取元素，删除，会返回到末尾的元素*/

Set<String> s = new HashSet <String>();

Queue<String> q = new PriorityQueue <String>();

Queue<String> q1 = new ArrayDeque <String>();

Map<String,String> info= new HashMap<String,String>();

info.put("name","zz");

info.put("age","16");

info.put("gender","male");

info.put("area","tianjin");

q.add("abc");

q.add("abc1");

q.add("abc2");

q.add("abc3");

q.add("abc4");

q1.add("c3");

q1.add("c4");

System.out.print(q.poll());

System.out.print(q.poll());

System.out.print(q.poll());

System.out.print(q.poll());

System.out.print(q.poll());

System.out.print(q.poll());

//poll 将元素取出后就删除掉

System.out.print(q1.poll());

System.out.print(q1.poll());

System.out.print(q1.poll());

System.out.print(info.get("name"));

System.out.print(info.get("age"));

System.out.print(info.get("gender"));

System.out.print(info.get("area"));

/*list1.add("abc");

list1.add("abcd");

list1.add("1");

list1.add("2");

list1.add("3");

Iterator it = list1.iterator();//叠代

while(it.hasNext()){

System.out.println(it.next());

}*/

}

}