fig3-28.java

数据结构与算法Java语言版（美）Adam Drozdek著

import java.io.*;
import java.util.*;

class TestArrayList {
    public static void main(String[] ar) {
        ArrayList lst1 = new ArrayList();
        lst1.add(new Integer(4));
        lst1.add(new Integer(5));
        lst1.add(new Integer(6));
        lst1.add(new Integer(4));
        ArrayList lst2 = new ArrayList(4);
        lst2.add(new Integer(3));
        lst2.add(new Integer(4));
        lst2.add(new Character('a'));
        lst2.add(new Double(1.1));
        System.out.println(lst1);
        System.out.println(lst2);
        lst1.removeAll(lst2);
        // difference: [4, 5, 6, 4] and [3, 4, a, 1.1] ==> [5, 6] 
        System.out.println(lst1);
        lst1.add(0,new Integer(4));
        lst1.add(new Integer(4));
        lst1.retainAll(lst2);
        // intersection: [4, 5, 6, 4] and [3, 4, a, 1.1] ==> [4, 4] 
        System.out.println(lst1);
        lst1.add(1,new Integer(5));
        lst1.add(2,new Integer(6));
        lst1.addAll(lst2);
        // union: [4, 5, 6, 4] and [3, 4, a, 1.1] ==> [4, 5, 6, 4, 3, 4, a, 1.1]
        System.out.println(lst1);
        List lst3 = lst1.subList(2,5);
        System.out.println(lst3);    // [6, 4, 3]
        lst1.set(3,new Integer(10)); // update lst1 and lst3
        System.out.println(lst1);    // [4, 5, 6, 10, 3, 4, a, 1.1]
        System.out.println(lst3);    // [6, 10, 3]
        lst3.clear();
        System.out.println(lst1);    // [4, 5, 4, a, 1.1]
        System.out.println(lst3);    // []

    }
}