Chapter 14.3, Problem 19SCP

Explanation of Solution

Given code:

//Assign the first element removed from the queue

int largest = q.remove();

//Execute loop till queue size

for (int i = 0; i < q.size() ; i++)

{

    //Find largest

    largest = Math.max(largest,q.remove ());

}

Error:

• The queue size is changing when the loop executes over it.
• The elements of the queue being examined are destroyed by this code.

Corrected code:

The above problem can be fixed by the below version of code,

//Create object for LinkedList

Queue<Integer> backup = new LinkedList<Integer>();

//Assign the first element removed from the queue

int largest = q.remove();

//Calculate the queue size

int size = q.size();

//Execute loop till queue size

for (int i = 0; i < size; i++)

{

    //Assign the element removed from the queue

    int n = q.remove();

/*Calculate and assign the maximum of previous and current element removed from the queue*/

    largest = Math...