Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

• Import necessary packages.
• Create a class “CompressedStack”,
  • Define the method “compressDuplicates ()” that accepts stack of integers,
    • Construct “LinkedList” object.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Execute till queue becomes empty,
      • Transfer all the elements from queue to stack.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Check whether the queue is non-empty,
      • Assign the first element removed from the queue.
      • Set duplicate count to “1”.
      • Execute till queue becomes empty,
        • Assign the nest element removed from the queue.
        • Check whether both removed elements are equal,
        • • Increment the duplicate count by “1”.
        • Otherwise,
        • • Insert the duplicate count into stack.
          • Insert the first element removed from the queue into the stack.
          • Set the duplicates count to “1”.
          • Set the second element to previous element.
            • Insert the duplicate count to the stack.
            • Insert the duplicated element into the stack.
    • Print the stack with a count of number of duplicates and the duplicated value.
  • Define the method “main()”,
    • Construct “Stack” object.
    • Add integers into the stack.
    • Print the stack of integers.
    • Call the method “compressDuplicates()” with stack as parameter.