Chapter 14, Problem 21E

Program Plan Intro

Move largest value to the top of the stack

Program plan:

• Import necessary packages.
• Create a class “StackMax”,
  • Define the method “maxToTop ()” that accepts stack of integers,
    • Check whether the stack is empty,
      • Return nothing.
    • Construct “LinkedList” object.
    • Set the first element retrieved from the stack as maximum.
    • Execute till stack becomes empty,
      • Assign top of stack to the variable.
      • Assign the maximum value returned from “max()” method.
      • Insert the element removed from top of stack into the queue.
    • Execute till queue becomes empty,
      • Transfer all the elements from queue to stack.
      • Check whether the popped out element and maximum value is not equal,
        • If it is true, insert the popped element into the queue.
    • Execute till queue becomes empty,
      • Transfer all the elements from queue to stack.
    • Insert the maximum value at the top of the stack.
    • Print the stack with maximum value at the top.
  • Define the method “main()”,
    • Construct “Stack” object.
    • Add integers into the stack.
    • Print the stack of integers.
    • Call the method “maxToTop()”with stack as parameter.