1

我正在解决一些练习练习，但我无法正确解决。问题要求我反向打印列表，它不应该采用任何参数，只调用 printReverse() 并反向打印列表。我想到了堆栈方式，这里是：

public class CircularList<E> implements List<E> {

  Node<E> list;
  int size;

  public CircularList() {
    list = new Node(null);
    list.setNext(list);
    size = 0;
  }

  @Override
  public void add(E element) {
    Node<E> newNode = new Node(element);
    newNode.setNext(list.getNext());
    list.setNext(newNode);
    size++;
  }

  @Override
  public boolean remove(E element) {
    Node<E> location = find(element);
    if (location != null) {
      location.setNext(location.getNext().getNext());
      size--;
    }
    return location != null;
  }

  @Override
  public E get(E element) {
    Node<E> location = find(element);
    if (location != null) {
      return (E) location.getNext().getInfo();
    }
    return null;
  }

  @Override
  public boolean contains(E element) {
    return find(element) != null;
  }

  @Override
  public int size() {
    return size;
  }

  @Override
  public Iterator<E> iterator() {
    return new Iterator<E>() {
      Node<E> tmp = list.getNext();

      @Override
      public boolean hasNext() {
        return tmp != list;
      }

      @Override
      public E next() {
        E info = tmp.getInfo();
        tmp = tmp.getNext();
        return info;
      }

      @Override
      public void remove() {
        throw new UnsupportedOperationException("Not supported yet.");
      }
    };
  }

  protected Node<E> find(E element) {
    Node<E> tmp = list;
    while (tmp.getNext() != list && !tmp.getNext().getInfo().equals(element)) {
      tmp = tmp.getNext();
    }

    if (tmp.getNext() == list) {
      return null;
    } else {
      return tmp;
    }
  }

  public void reversePrinter() {

    Stack stack = new Stack();
    Node<E> temp = list;

    for (int i = 0; i < size; i++) {
        stack.push(temp.getInfo());
        temp = temp.getNext();
      }

    while (! stack.empty()) {
      System.out.print(stack.pop());
    }
  }
}

节点.java

public class Node<E> {

  E info;
  Node<E> next;

  public Node(E element) {
    info = element;
    next = null;
  }

  public void setInfo(E element) {
    info = element;
  }

  public E getInfo() {
    return info;
  }

  public void setNext(Node<E> next) {
    this.next = next;
  }

  public Node<E> getNext() {
    return next;
  }
}

主.java

public class Main {

  public static void main(String[] args) {
    CircularList<String> x = new CircularList<String>();

    x.add("hi");
    x.add("hhhh");
    x.add("hi");
    x.add("hhhh");
    x.add("hi");
    x.reversePrinter();


  }
}

这打印： hhhh hi hhhh hi null

它应该打印： hi hhhh hi hhhh hi

请帮我解决。谢谢！

4

3 回答 3

2

考虑更换你的循环：

for (int i = 0; i < size; i++) {
    stack.push(temp.getInfo());
    temp = temp.getNext();
  }

使用您的迭代器进行以下操作：

for (Node<E> n : this) {
    stack.push(n);
}

等效地：

public void reversePrinter() {
    Stack stack = new Stack();        //create a stack for reversing order
    Iterator<E> it = this.iterator(); //get this object's iterator
    while(it.hasNext())               //while there is still another object
      stack.push(it.next());          //add the next object to the stack

    while(!stack.empty())             //while the stack is not empty
      System.out.print(stack.pop());  //print the data from the stack
}

假设您的迭代器已正确实现，这应该可以工作

于 2013-05-11T19:25:07.523 回答
1

字段列表总是指向一个带有空元素的无关节点。

    Stack<E> stack = new Stack<>();
    Node<E> temp = list.getNext();
于 2013-05-11T19:45:22.223 回答
1

问题出在 reversePrinter 方法中：

public void reversePrinter() {

    Stack<E> stack = new Stack();
    Node<E> temp = list.getNext();

    for (int i = 0; i < size; i++) {
        stack.push(temp.getInfo());
        temp = temp.getNext();
      }

    while (! stack.empty()) {
      System.out.print(stack.pop());
    }
  }

初始化

Node<E> temp = list.getNext();

代替

Node<E> temp = list;

也可以使用迭代器。

于 2013-05-11T19:57:33.633 回答