Printable View
I need some help with this homework assignment:
Design a method for keeping two stacks within a single linear array s[SPACESIZE] so that neither stack overflows until all of memory is used and an entire stack is never shifted to a different location within the array. Write Java methods push1, push2, pop1, and pop2 to manipulate the two stacks. (the two stacks grow toward each other.)
Please show us what you've done so far, and then ask a specific question that we can answer.
Since a stack is virtually not limited by size, if I am going to use an array to manage 2 stacks, I have to initialize the stack to some value, so I picked 5000
Array<E> myArray;
I imagine that one stack will need to start at the floor of the array and grow up and the other stack will start at the roof of the array and grow down, and you will need two int index variables to represent the current location of the top of each stack, taking care that one index does not pass the other.
I think I have it correct now, I just had to walk through it mentally. Does my use of generics look correct? I am trying to say that my array is going to have items of type E