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.

Question

Want to see the full answer?

Answer 1

Question

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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Don't use ai to answer I will report you answer

You can use Eclipse later for program verification after submission. 1. Create an abstract Animal class. Then, create a Cat class. Please implement all the methods and inheritance relations in the UML correctly: Animal name: String # Animal (name: String) + getName(): String + setName(name: String): void + toString(): String + makeSound(): void Cat breed : String age: int + Cat(name: String, breed: String, age: int) + getBreed(): String + getAge (): int + toString(): String + makeSound(): void 2. Create a public CatTest class with a main method. In the main method, create one Cat object and print the object using System.out.println(). Then, test makeSound() method. Your printing result must follow the example output: name: Coco, breed: Domestic short-haired, age: 3 Meow Meow

automata theory can please wright the exact language it know for example say it knows strings start 0 and end with 1 this is as example also as regular expression