-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathReverseLinkedList.java
34 lines (28 loc) · 1.15 KB
/
ReverseLinkedList.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
package list;
import java.util.LinkedList;
public class ReverseLinkedList {
public static void main(String[] args) {
java.util.Scanner scanner = new java.util.Scanner(System.in);
LinkedList<Integer> list = new LinkedList<>();
System.out.print("Enter number for length of list: ");
int length = scanner.nextInt();
System.out.print("Enter elements of list: ");
for (int i = 0; i < length; i++) {
list.add(scanner.nextInt());
}
System.out.println("Reversed list: " + reverseBruteForce(list));
System.out.println("Reversed list: " + reverse(list));
}
private static LinkedList<Integer> reverse(LinkedList<Integer> list) {
LinkedList<Integer> reversedList = new LinkedList<>();
list.descendingIterator().forEachRemaining(reversedList::add);
return reversedList;
}
private static LinkedList<Integer> reverseBruteForce(LinkedList<Integer> list) {
LinkedList<Integer> reversedList = new LinkedList<>();
for (int i = list.size() - 1; i >= 0; i--) {
reversedList.add(list.get(i));
}
return reversedList;
}
}