Advertisement
Guest User

Untitled

a guest
May 1st, 2016
60
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.93 KB | None | 0 0
  1. public class BrianLinkedList {
  2.  
  3. private class Node {
  4. int value;
  5. Node next;
  6. Node(int value, Node n) {
  7. this.next = n;
  8. this.value = value;
  9. }
  10. }
  11.  
  12. private int size = 0;
  13. private Node head = new Node(0, null);
  14. private Node tail = null;
  15.  
  16.  
  17. BrianLinkedList() {
  18. tail = head;
  19. }
  20.  
  21. void add(int value) {
  22. tail.next = new Node(value, null);
  23. tail = tail.next;
  24. size++;
  25. }
  26.  
  27. void delete(int value) {
  28. if (size == 0)
  29. return;
  30. else {
  31. Node pointer = head;
  32. while (pointer.next != null) {
  33. if (pointer.next.value == value) {
  34. size--;
  35. pointer.next = pointer.next.next;
  36. }
  37.  
  38. pointer = pointer.next;
  39. }
  40.  
  41.  
  42.  
  43. size--;
  44. }
  45. }
  46.  
  47. int size() {
  48. return size;
  49. }
  50.  
  51.  
  52. public static void main(String[] args) {
  53. BrianLinkedList b = new BrianLinkedList();
  54.  
  55. b.add(1);
  56. b.add(1);
  57. b.add(1);
  58. b.add(1);
  59. b.delete(1);
  60.  
  61. System.out.println(b.size());
  62. }
  63. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement