test.java

java版的数据结构的完全代码 免费提供了 学习数据结构的请下载

/** Test code from part 2. */
public class Test {

  public static void main(String[] args) {
    // Array stack
    {
      System.out.println("Array stack:");
      Stack<Integer> s = new ArrayStack<Integer>();
      for (int i = 1; i <= 5; i++) {
        s.push(i);
      }
      for (int i = 1; i <= 5; i++) {
        System.out.print(s.pop());
      }
      System.out.println();
    }
    // Array queue
    {
      System.out.println("Array queue:");
      Queue<Integer> q = new ArrayQueue<Integer>();
      for (int i = 1; i <= 5; i++) {
        q.add(i);
      }
      for (int i = 1; i <= 5; i++) {
        System.out.print(q.remove());
      }
      System.out.println();
    }
    // Array list
    {
      System.out.println("Array list:");
      List<Integer> ls = new ArrayList<Integer>();
      for (int i = 1; i <= 5; i++) {
        ls.add(i);
      }
      System.out.println(ls);
      ls.set(4, 99);
      System.out.println(ls);
      System.out.println(ls.contains(new Integer(3)));
      System.out.println(ls.get(0));
      System.out.println(ls.isEmpty());
      System.out.println(ls.size());
      for (int i = 1; i <= 5; i += 2) {
        ls.remove(new Integer(i));
      }
      System.out.println(ls);
      System.out.println(ls.contains(new Integer(3)));
      ls.remove(0);
    }
    // Linked stack
    {
      System.out.println("Linked stack:");
      Stack<Integer> s = new LinkedStack<Integer>();
      for (int i = 1; i <= 5; i++) {
        s.push(i);
      }
      for (int i = 1; i <= 5; i++) {
        System.out.print(s.pop());
      }
      System.out.println();
    }
    // Linked queue
    {
      System.out.println("Linked queue:");
      Queue<Integer> q = new LinkedQueue<Integer>();
      for (int i = 1; i <= 5; i++) {
        q.add(i);
      }
      for (int i = 1; i <= 5; i++) {
        System.out.print(q.remove());
      }
      System.out.println();
    }
    // Linked list
    {
      System.out.println("Linked list:");
      List<Integer> ls = new LinkedList<Integer>();
      for (int i = 1; i <= 5; i++) {
        ls.add(i);
      }
      System.out.println(ls);
      ls.set(4, 99);
      System.out.println(ls);
      System.out.println(ls.contains(new Integer(3)));
      System.out.println(ls.get(0));
      System.out.println(ls.isEmpty());
      System.out.println(ls.size());
      for (int i = 1; i <= 5; i += 2) {
        ls.remove(new Integer(i));
      }
      System.out.println(ls);
      System.out.println(ls.contains(new Integer(3)));
      ls.remove(0);
    }
  }

}