集合类

1.ArrayList的用法

1 package Collection;
 2 
 3 import java.util.ArrayList;
 4 import java.util.Iterator;
 5 import java.util.List;
 6 
 7 public class ArrayList_Test {
 8     public static void main(String[] args) {
 9        List <Integer> Int_Num = new ArrayList<Integer>();
10        //添加元素
11        Int_Num.add(new Integer(1));
12        Int_Num.add(new Integer(4));
13        Int_Num.add(new Integer(10));
14        Int_Num.add(new Integer(5));
15        Int_Num.add(new Integer(209));
16        //Int_Num.add(new Double(2.5));编译时会报错
17 
18         // 删除元素
19         Int_Num.remove("1");//根据对象删除
20         Int_Num.remove(0);//根据下标删除
21 
22         //元素遍历
23         //1.迭代器
24         Integer value = null;
25         Iterator iter = Int_Num.iterator();
26         while (iter.hasNext()) {
27             value = (Integer)iter.next();
28             System.out.print(value+ "  ");
29         }
30         System.out.println();
31 
32         //2.随机访问，通过索引值去遍历
33         int size = Int_Num.size();
34         for (int i=0; i<size; i++) {
35             value = (Integer)Int_Num.get(i);
36             System.out.print(value+ "  ");
37         }
38         System.out.println();
39 
40         //3.for循环遍历
41         for (Integer integ:Int_Num) {
42             value = integ;
43             System.out.print(value+ "  ");
44         }
45 
46 
47 
48 
49     }
50 }

2.LinkList对象应用

1 package Collection;
 2 
 3 import java.util.*;
 4 public class LinkList_Test {
 5     public static void main(String args[]) {
 6 
 7         //添加元素
 8         LinkedList list = new LinkedList();
 9         list.add("A");
10         list.add("B");
11         list.add("C");
12         list.add("D");
13         list.addFirst("X");
14         list.addLast("Z");
15         System.out.println(list);
16 
17         //删除元素
18         list.removeFirst();
19         list.removeLast();
20         System.out.println(list);
21 
22     }
23 }

3.Vector的用法

1 package Collection;
 2 
 3 import java.util.Enumeration;
 4 import java.util.Vector;
 5 
 6 public class Vector_Test {
 7     public static void main(String[] args) {
 8         Vector <String> v = new Vector();
 9 
10         //增加
11         v.addElement("abc1");
12         v.addElement("abc2");
13         v.addElement("abc3");
14         v.addElement("abc4");
15 
16         //删除
17         v.remove("abc1");
18 
19         //遍历
20         Enumeration en = v.elements();
21         while (en.hasMoreElements()) {
22             Object object = en.nextElement();
23             if (object.equals("abc3")) {
24                 v.addElement("abc5"); // 不会出现异常
25             }
26             System.out.println(object);
27         }
28 
29     }
30 }

4.Stack的用法

Stack继承了Vector类，实现了栈结构

1 package Collection;
 2 
 3 import java.util.*;
 4 public class Stack_Test {
 5     public static void main(String[] args){
 6         Stack stk=new Stack();
 7         for(int i=0;i<10;i++)
 8             stk.push(i);  // autoboxing
 9         System.out.println("stk="+ stk);
10         System.out.println("popping elements:");
11         while(!stk.empty())
12             System.out.println(stk.pop());
13     }
14 }

5.Map的用法

1 package Collection;
 2 
 3 import java.util.HashMap;
 4 import java.util.Iterator;
 5 import java.util.Map;
 6 import java.util.Set;
 7 
 8 public class Map_Test{
 9     public static void main(String[] args) {
10         //创建Map对象
11         Map<String, String> map = new HashMap<String,String>();
12 
13         //增加
14         map.put("1", "Java");
15         map.put("2", "数据库");
16         map.put("3", "概率论");
17 
18         //获取Map中的所有key
19         Set<String> keySet = map.keySet();
20 
21         //遍历存放所有key的Set集合
22         Iterator<String> it =keySet.iterator();
23         while(it.hasNext()){                         
24             //得到每一个key
25             String key = it.next();
26             //通过key获取对应的value
27             String value = map.get(key);
28             System.out.println(key+"="+value);
29         }
30     }
31 }