如何避免在 Java 中使用库中的堆栈方法

Question

如何在不使用实用程序库中的堆栈方法的情况下从头开始编码或创建堆栈？

Answer 1

堆栈具有顶部项目和指向堆栈其余部分的指针。您可以使用列表或数组来实现堆栈是一种线性数据结构，它遵循执行操作的特定顺序。在栈中主要进行以下三个基本操作：推送：在堆栈中添加一个项目。如果堆栈已满，则称其为溢出条件。Pop：从堆栈中移除一个项目。这些项目以它们被推送的相反顺序弹出。Peek or Top：返回栈顶元素。isEmpty：如果堆栈为空则返回真，否则返回假。class Stack&nbsp;{&nbsp;&nbsp; &nbsp; static final int MAX_ELEMENT = 100;&nbsp;&nbsp; &nbsp; int top;&nbsp;&nbsp; &nbsp; int a[] = new int[MAX_ELEMENT]; // Maximum size of Stack&nbsp;boolean isEmpty()&nbsp;{&nbsp;&nbsp; &nbsp; return (top < 0);&nbsp;}&nbsp;Stack()&nbsp;{&nbsp;&nbsp; &nbsp; top = -1;&nbsp;}&nbsp;boolean push(int x)&nbsp;{&nbsp;&nbsp; &nbsp; if (top >= (MAX_ELEMENT -1))&nbsp;&nbsp; &nbsp; {&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; System.out.println("Stack Overflow");&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; return false;&nbsp;&nbsp; &nbsp; }&nbsp;&nbsp; &nbsp; else&nbsp; &nbsp; {&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; a[++top] = x;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(x + " pushed into stack");&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; return true;&nbsp;&nbsp; &nbsp; }&nbsp;}&nbsp;int pop()&nbsp;{&nbsp;&nbsp; &nbsp; if (top < 0)&nbsp;&nbsp; &nbsp; {&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; System.out.println("Stack Underflow");&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; return 0;&nbsp;&nbsp; &nbsp; }&nbsp;&nbsp; &nbsp; else&nbsp; &nbsp; {&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; int x = a[top--];&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; return x;&nbsp;&nbsp; &nbsp; }&nbsp;}&nbsp;}

Answer 2

您应该创建自己的类，从 Vector 扩展它，并实现您需要的所有方法。或者只是使用所有方法创建自己的类。或者你可以从 Stack 类扩展你的类并覆盖你想要改变的行为的方法