USING JAVA: Implement a method called reverse (\"public static void reverse(Link

ID: 3777737 • Letter: U

Question

USING JAVA: Implement a method called reverse ("public static void reverse(LinkedList strings)") that takes in a LinkedList of strings and reverses each entry in the linked list.

Main Class:

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Stack;

import java.util.LinkedList;

public class ListReverser {

   public static void main(String[] args) {
      LinkedList lst = new LinkedList();
      lst.addLast("D");
      lst.addLast("H");
      lst.addLast("R");
      lst.addLast("T");

      System.out.println("Original:");
      System.out.println(lst);
      reverse(lst);

      System.out.println(" Reversed:");
      System.out.println(lst);
   }
}

Explanation / Answer

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Stack;
import java.util.LinkedList;
public class Main {

public static void main(String[] args) {
LinkedList lst = new LinkedList();
lst.addLast("D");
lst.addLast("H");
lst.addLast("R");
lst.addLast("T");

System.out.println("Original:");
System.out.println(lst);
reverse(lst);

System.out.println(" Reversed:");
System.out.println(lst);
}

public static void reverse(LinkedList lst){
// push elements to stack, and add elements of stack to linkedlist
Stack stack = new Stack();
int i=0;
while(lst.size()>0){
stack.push(lst.get(i));
lst.remove(lst.get(i));
}
i=0;
while(stack.size()>0){
lst.addLast(stack.pop());
}
}
}
/*
sample output
Original:
[D, H, R, T]

Reversed:
[T, R, H, D]
*/

Navigate

USING JAVA: Create a Plane class. This class will represent a plane in our syste

USING JAVA: Implement the quicksort optimization median-of-three , i.e., first,

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

USING JAVA: Implement a method called reverse (\"public static void reverse(Link

Question

Explanation / Answer

Related Questions

Navigate