LinkedList.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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 |
public class LinkedList<T> { private class Node<T> { T data; Node<T> next; public Node(T data){ this.data = data; } public Node(T data, Node<T> next){ this(data); this.next = next; } public String toString(){ return data.toString(); } } private Node<T> head, tail; private int count; public LinkedList(){ head = tail = null; count = 0; } public LinkedList(T d){ head = tail = new Node<T>(d); count = 1; } public void append(T d){ tail = tail.next = new Node<T>(d); count++; } public void prepend(T d){ if (isEmpty()) { head = tail = new Node<T>(d); } else { head = new Node<T>(d, head); } count++; } public T getFirst() { return head.data; } public String toString(){ String retVal = "Linked List with " + count + " nodes: "; for (Node<T> temp = head ; temp != null ; temp = temp.next){ retVal += temp + " "; } return retVal; } /* You implement: * public void insert(T data, int index) * public boolean exists(T data) * public boolean remove(T data) * public T get(int index) */ } |
Main.java
1 2 3 4 5 6 7 8 |
public class Main { public static void main(String[] a) { LinkedList<String> ll = new LinkedList<>("abc"); ll.prepend("def"); ll.append("hij"); System.out.println(ll.toString()); } } |