import ADTs.QueueADT; import DataStructures.ArrayStack; import ADTs.StackADT; import DataStructures.LinkedQueue; import java.util.Scanner; /** * * @author Qiong */ public class RepeatStrings { public static void main(String[] argv) throws Exception{ final int SIZE = 3; Scanner keyboard = new Scanner(System.in); QueueADT stringQueue; //stringQueue = new CircularArrayQueue(SIZE); stringQueue = new LinkedQueue(); StackADT stringStack; stringStack = new ArrayStack(SIZE); String line; for (int i = 0; i < SIZE; i++){ System.out.print("Enter a line of text which includes only 3 words > "); line = keyboard.nextLine(); //TODO enque the new element //TODO push the new element } System.out.println("\nOrder is: "); for (int i = 0; i < SIZE; i++){ // TODO Remove an element in the order in which we input strings // Save it to the String variable, named line System.out.println(line); } System.out.println("\nOpposite order is: "); for (int i = 0; i < SIZE; i++){ // TODO Remove an element in the order opposite to they were entered // Save it to the String variable, named line System.out.println(line); } } }
import ADTs.QueueADT;
import DataStructures.ArrayStack;
import ADTs.StackADT;
import DataStructures.LinkedQueue;
import java.util.Scanner;
/**
*
* @author Qiong
*/
public class RepeatStrings {
public static void main(String[] argv) throws Exception{
final int SIZE = 3;
Scanner keyboard = new Scanner(System.in);
QueueADT<String> stringQueue;
//stringQueue = new CircularArrayQueue<String>(SIZE);
stringQueue = new LinkedQueue<String>();
StackADT<String> stringStack;
stringStack = new ArrayStack<String>(SIZE);
String line;
for (int i = 0; i < SIZE; i++){
System.out.print("Enter a line of text which includes only 3 words > ");
line = keyboard.nextLine();
//TODO enque the new element
//TODO push the new element
}
System.out.println("\nOrder is: ");
for (int i = 0; i < SIZE; i++){
// TODO Remove an element in the order in which we input strings
// Save it to the String variable, named line
System.out.println(line);
}
System.out.println("\nOpposite order is: ");
for (int i = 0; i < SIZE; i++){
// TODO Remove an element in the order opposite to they were entered
// Save it to the String variable, named line
System.out.println(line);
}
}
}
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)