Java Practice It | Exercise 14.14: reverseFirstK | Collections,
More practice its:
• Java | Practice-It | Self Check & Exercise...
Problem:
https://practiceit.cs.washington.edu/...
Question:
Write a method reverseFirstK that accepts an integer k and a queue of integers as parameters and reverses the order of the first k elements of the queue, leaving the other elements in the same relative order. For example, suppose a variable q stores the following elements:
front [10, 20, 30, 40, 50, 60, 70, 80, 90] back
The call of reverseFirstK(4, q); should change the queue to store the following elements in this order:
front [40, 30, 20, 10, 50, 60, 70, 80, 90] back
If k is 0 or negative, no change should be made to the queue. If the queue passed is null or does not contain at least k elements, your method should throw an IllegalArgumentException.
For full credit, obey the following restrictions in your solution. A solution that disobeys them can get partial credit.
You may use one queue or stack (but not both) as auxiliary storage.
You may not use other structures (arrays, lists, etc.), but you can have as many simple variables as you like.
Use the Queue interface and Stack/LinkedList classes discussed in lecture.
Use stacks/queues in stack/queue-like ways only. Do not call index-based methods such as get, search, or set (or use a for-each loop) on a stack/queue. You may call only add, remove, push, pop, peek, isEmpty, and size.
You have access to the following two methods and may call them as needed to help you solve the problem:
public static void s2q(Stack s, Queue q) { ... }
public static void q2s(Queue q, Stack s) { ... }
On this page of the site you can watch the video online Java Practice It | Exercise 14.14: reverseFirstK | Collections, with a duration of hours minute second in good quality, which was uploaded by the user Computer Engineering life 13 July 2023, share the link with friends and acquaintances, this video has already been watched 146 times on youtube and it was liked by 2 viewers. Enjoy your viewing!
