package comp1110.exam;
import java.util.EmptyStackException;
Copyright By PowCoder代写 加微信 powcoder
* COMP1110 Exam, Question 4
* This class represents a stack, in which elements are added and removed in a
* last in, first out (LIFO) order. Duplicate elements are permitted.
* When a stack is first created, it contains no elements.
* The stack can grow to fit new elements as required.
* Attempting to pop() or peek() an empty stack throws an EmptyStackException,
* and does not result in any modification to the stack.
* The Stack is implemented using an array data structure (a regular Java array),
* and does not use any of the Java Collection classes other than
* java.util.EmptyStackException.
public class Q4ArrayStack
* @return true if the stack is empty
public boolean isEmpty() {
// FIXME complete this method
return false;
* Add the given value to this stack,
* placing it at the top of the stack.
* @param value the value to add to this stack
public void push(T value) {
// FIXME complete this method
* Remove the value that is at the top of this stack, and return it.
* @return the value that was popped from the stack
* @throws EmptyStackException if the stack is currently empty
public T pop() {
// FIXME complete this method
return null;
* Get the value that is currently at the top of this stack,
* but do not remove it from the stack.
* @return the value at the top of the stack
* @throws EmptyStackException if the stack is currently empty
public T peek() {
// FIXME complete this method
return null;
* Check whether a given value is contained in this stack.
* Specifically, returns true if value is not null and
* an element e is contained in the stack such that e.equals(value).
* @param value the value to search for
* @return true if the value is contained in this stack
public boolean contains(T value) {
// FIXME complete this method
return false;
* Create a String representation of this stack.
* Elements on the stack are listed in order from top to bottom,
* separated by commas (without spaces).
* If the stack is empty, an empty string is returned.
* For example, a stack containing the elements (from top to bottom)
* “a”, “b”, and “c” would be represented as “a,b,c”.
* @return a String representation of this stack
public String toString() {
// FIXME complete this method
return null;
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com