java - 通过链接堆栈反转单链表

Question

是的，这是作业。我必须反转单链表。导师/ friend 告诉我，我应该使用堆栈，这样第一个进去的就是最后一个出来的。我有这个，根本没什么，我不知道现在该怎么办。GameEntry 列表已提供。有朝正确方向插入的吗？

    package project;

import java.util.LinkedList;
import dsaj.arrays.GameEntry;
import net.datastructures.*;

public class reverse {

public static void main(String[] args) 
{SinglyLinkedList<GameEntry>list = new SinglyLinkedList<GameEntry>();


list.addFirst(new GameEntry ("A", 0 ));
list.addFirst(new GameEntry ("B", 1 ));
list.addFirst(new GameEntry ("C", 2 ));
list.addFirst(new GameEntry ("D", 3 ));
list.addFirst(new GameEntry ("E", 4 ));
list.addFirst(new GameEntry ("F", 5 ));
list.addFirst(new GameEntry ("G", 6 ));
list.addFirst(new GameEntry ("H", 7 ));
list.addFirst(new GameEntry ("I", 8 ));
list.addFirst(new GameEntry ("J", 9 ));
System.out.printf("\nList before reverse\n %s", list);

SinglyLinkedList<GameEntry>list2 = new SinglyLinkedList<GameEntry>();
LinkedStack<GameEntry>stack =new LinkedStack<GameEntry>();                 
} 
  }

Answer 1

迭代list，将值(迭代时)插入stack。然后将值(从 stack)弹出到 list2 中，直到没有 stack 中的项目。它可能看起来像这样

for (GameEntry ge : list) {
    stack.push(ge);
}
while (!stack.isEmpty()) {
    list2.add(stack.pop());
}