Question: Problem 1.Add a methodItem[] multiPop(int k)toStackthat pops k elements from the stack and returns them as an array of objects. Note:forproblem 1,assume you are adding
Problem 1.Add a methodItem[] multiPop(int k)toStackthat pops k elements from the stack and returns them as an array of objects.
Note:forproblem 1,assume you are adding it this method to one of our in-class stack implementationsArrayStack,LinkedListStack, orDynamicArrayStack- state which of these classes you are adding your method to.
I want to add the method to ArrayList.
ArrayList
public class MyArrayStringStack implements MyStringCollection
{
private String[] array;
private int stackPointer;
public MyArrayStringStack(int size)
{
this.array = new String[size];
this.stackPointer = 0;
}
public MyArrayStringStack(MyArrayStringStack mass)
{
this.array = new String[mass.toArray().length];
String[] temp = mass.toArray();
for (int i = 0; i < temp.length; i++)
{
this.array[i] = temp[i];
}
}
@Override
public void insert(String myString)
{
if (this.stackPointer < this.array.length)
{
this.array[this.stackPointer++] = myString;
}
else
{
System.out.println("Stack overflow!");
}
}
@Override
public String remove()
{
if (!this.isEmpty())
{
return this.array[--this.stackPointer];
}
else
{
System.out.println("Stack empty!");
return "";
}
}
@Override
public boolean isEmpty()
{
return (this.stackPointer == 0);
}
public String[] toArray()
{
return this.array;
}
public static void main(String[] args) {
MyArrayStringStack mass = new MyArrayStringStack(5);
mass.insert("Hello"); // 0++ -> 1
mass.insert("World"); // 1++ -> 2
mass.insert("This"); // 2++ -> 3
mass.insert("Something"); // 3++ -> 4
mass.insert("Else"); // 4++ -> 5
mass.insert("Blah");
System.out.println(mass.remove());
System.out.println(mass.remove());
System.out.println(mass.remove());
System.out.println(mass.remove());
System.out.println(mass.remove());
System.out.println(mass.remove());
}
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
