Chapter 14.3, Problem 20SCP

Explanation of Solution

Given code:

//Initialize the variable "sum" to "0"

int sum = 0;

//Execute while queue is non-empty

while (!q.isEmpty())

{

    /*Check whether the element removed from the queue is greater than "0"*/

    if (q.remove() > 0 )

    {

        //Update the "sum" value

        sum += q.remove ();

    }

}

Error:

• The method “remove()” is called two times on each element, which double-removes the element and hence, the element is skipped.
• 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,

//Initialize the variable "sum" to "0"

int sum = 0;

//Create the object for LinkedList

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

//Execute while queue is non-empty

while (!q.isEmpty())

{

    //Assign the element removed from the old queue

    int n1 = q...