import java.util.NoSuchElementException; class LinkedList { private Node head; private Node tail; private class Node { private int value; private Node next; public Node(int value) { this.value = value; } } private boolean isEmpty() { return (head == null); } private boolean hasNext(Node node) { return (node.next != null); } public void print() { Node current = head; System.out.print("["); while (current != null) { if (hasNext(current)) { System.out.print(current.value + "' "); } else { System.out.print(current.value); } current = current.next; } System.out.println("]");} public void addFirst(int value) { Node node = new Node(value); if (isEmpty()) { head = tail = node; } else { node.next = head; head = node; } } public void addLast(int value) { Node node = new Node(value); if (isEmpty()) { head = tail = node; } else { tail.next = node; tail = node; } } public int indexOf(int value) { int i = 0; Node current = head; while (current != null) { if (current.value == value) { return i; } i++; current = current.next; } return -1; } public boolean contains(int value) { return (indexOf(value) != -1); } public void deleteFirst() throws NoSuchElementException { if (isEmpty()) { throw new NoSuchElementException(); } if (head == tail) { head = tail = null; return; } Node formerHeadNext = head.next; head.next = null; head = formerHeadNext; } public Node previous(Node node) throws NoSuchElementException { if (isEmpty()) throw new NoSuchElementException(); Node current = head; while (current.next != node) { if (!hasNext(current)) { throw new NoSuchElementException(); } current = current.next; } return current; } public void deleteLast() throws NoSuchElementException { if (isEmpty()) throw new NoSuchElementException(); if (head == tail) { head = tail = null; return; } Node lastButOne = previous(tail); lastButOne.next = null; tail = lastButOne; } } public class LinkedListFromScratch { public static void main(String[] args) { LinkedList myList = new LinkedList(); myList.addLast(2); myList.addLast(4); myList.addLast(8); myList.addFirst(-2); myList.addFirst(-4); myList.addLast(9); myList.print(); System.out.println(myList.indexOf(4)); System.out.println(myList.contains(9)); for (int i = 0; i < 6; ++i) { myList.deleteLast(); myList.print(); } } } In this linked list Add in an O(n) method that reverse to the class LinkedList created in the problem 1. This method must reverse the order of the nodes in the list. For example, having applied reverse to the list [2 → 4 → 8 → 9 → 8], we will change it to [8 → 9 → 8 → 4 → 2].
import java.util.NoSuchElementException;
class LinkedList {
private Node head;
private Node tail;
private class Node {
private int value;
private Node next;
public Node(int value) {
this.value = value;
}
}
private boolean isEmpty() {
return (head == null);
}
private boolean hasNext(Node node) {
return (node.next != null);
}
public void print() {
Node current = head;
System.out.print("[");
while (current != null) {
if (hasNext(current)) {
System.out.print(current.value + "' ");
} else {
System.out.print(current.value);
}
current = current.next;
}
System.out.println("]");}
public void addFirst(int value) {
Node node = new Node(value);
if (isEmpty()) {
head = tail = node;
} else {
node.next = head;
head = node;
}
}
public void addLast(int value) {
Node node = new Node(value);
if (isEmpty()) {
head = tail = node;
} else {
tail.next = node;
tail = node;
}
}
public int indexOf(int value) {
int i = 0;
Node current = head;
while (current != null) {
if (current.value == value) {
return i;
}
i++;
current = current.next;
}
return -1;
}
public boolean contains(int value) {
return (indexOf(value) != -1);
}
public void deleteFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException();
}
if (head == tail) {
head = tail = null;
return;
}
Node formerHeadNext = head.next;
head.next = null;
head = formerHeadNext;
}
public Node previous(Node node) throws NoSuchElementException {
if (isEmpty())
throw new NoSuchElementException();
Node current = head;
while (current.next != node) {
if (!hasNext(current)) {
throw new NoSuchElementException();
}
current = current.next;
}
return current;
}
public void deleteLast() throws NoSuchElementException {
if (isEmpty())
throw new NoSuchElementException();
if (head == tail) {
head = tail = null;
return;
}
Node lastButOne = previous(tail);
lastButOne.next = null;
tail = lastButOne;
}
}
public class LinkedListFromScratch {
public static void main(String[] args) {
LinkedList myList = new LinkedList();
myList.addLast(2);
myList.addLast(4);
myList.addLast(8);
myList.addFirst(-2);
myList.addFirst(-4);
myList.addLast(9);
myList.print();
System.out.println(myList.indexOf(4));
System.out.println(myList.contains(9));
for (int i = 0; i < 6; ++i) {
myList.deleteLast();
myList.print();
}
}
}
In this linked list Add in an O(n) method that reverse to the class LinkedList created in the problem
1. This method must reverse the order of the nodes in the list. For
example, having applied reverse to the list [2 → 4 → 8 → 9 → 8], we
will change it to [8 → 9 → 8 → 4 → 2].
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
