链表，它可以在末尾添加、在开头添加、删除和显示内容 — Java

huangapple
go评论142阅读模式
英文:

Linked List that appends, prepends, delete and show contents -- Java

问题

  1. public class LinkedListLogic {
  2.     
  3.     private class Node {
  4.         Node next;
  5.         int data;
  7.         public Node(int data) {
  8.             this.data = data;
  9.         }
  10.     }
  12.     Node head;
  14.     public void addToLastElement(int data) {
  15.         if (head == null) {
  16.             head = new Node(data);
  17.             return;
  18.         }
  20.         Node current = head;
  21.         while (current.next != null) {
  22.             current = current.next;
  23.         }
  24.         current.next = new Node(data);  // Appending a new node at the end
  25.     }
  27.     public void insertAtBeginning(int data) {
  28.         Node newHead = new Node(data);
  29.         newHead.next = head;
  30.         head = newHead;
  31.     }
  33.     public void deleteAtSpecificValue(int data) {
  34.         if (head == null) {
  35.             return;
  36.         }
  37.         if (head.data == data) {
  38.             head = head.next;  // Removing the first node
  39.             return;
  40.         }
  41.         Node current = head;
  42.         while (current.next != null && current.next.data != data) {
  43.             current = current.next;
  44.         }
  45.         if (current.next != null) {
  46.             current.next = current.next.next;  // Deleting the node with specific value
  47.         }
  48.     }
  50.     public void printAll() {
  51.         for (Node current = head; current != null; current = current.next) {
  52.             System.out.println(current.data);
  53.         }
  54.     }
  56.     public static void main(String[] args) {
  57.         LinkedListLogic a = new LinkedListLogic();
  58.         a.addToLastElement(2);
  59.         a.addToLastElement(4);
  60.         a.printAll();
  61.     }
  62. }
英文:

I've just started to learn about linked lists and I am attempting to implement my understanding of it. However, it does not work and program runs without errors.

The program should be able to append, insert at the beginning, delete a node that contains a specific value and print out the contents. The program runs but does not show anything

  1. public class LinkedListLogic {
  2. private class Node {
  3. Node next;
  4. int data;
  5. public Node(int data) {
  6. this.data = data;
  7. }
  8. }
  9. Node head;
  10. public void addToLastElement(int data) {
  11. if (head == null) {
  12. head = new Node(data);
  13. return;
  14. }
  15. Node current = head;
  16. while (current.next != null) {
  17. current = current.next;
  18. }
  19. }
  20. public void insertAtBeginning(int data) {
  21. Node newHead = new Node(data);
  22. newHead.next = head;
  23. head = newHead;
  24. }
  25. public void deleteAtSpecificValue(int data) {
  26. if (head == null) {
  27. return;
  28. }
  29. if (head.data == data) {
  30. head = head.next;
  31. }
  32. Node current = head;
  33. while (current.next.data != data) {
  34. current = current.next;
  35. }
  36. current.next = current.next.next; 
  37. return;                           
  38. }
  39. public void printAll() {
  40. for (Node current = head; current.next != null; current = current.next) {
  41. System.out.println(current.data);
  42. }
  43. return;
  44. }
  45. public static void main(String[] args) {
  46. LinkedListLogic a = new LinkedListLogic();
  47. a.addToLastElement(2);
  48. a.addToLastElement(4);
  49. a.printAll();
  50. }
  51. }

答案1

得分: 0

感谢Andy Turner指出的错误

  1. public class LinkedListLogic {
  3.     private class Node {
  4.         Node next;
  5.         int data;
  7.         public Node(int data) {
  8.             this.data = data;
  9.         }
  10.     }
  12.     Node head;
  14.     public void addToLastElement(int data) {
  15.         if (head == null) {
  16.             head = new Node(data);
  17.             return;
  18.         }
  20.         Node current = head;
  21.         while (current.next != null) {
  22.             current = current.next;
  23.         }
  24.         current.next = new Node(data);
  25.     }
  27.     public void insertAtBeginning(int data) {
  28.         Node newHead = new Node(data);
  29.         newHead.next = head;
  30.         head = newHead;
  31.     }
  33.     public void deleteAtSpecificValue(int data) {
  34.         if (head == null) {
  35.             return;
  36.         }
  37.         if (head.data == data) {
  38.             head = head.next;
  39.         }
  40.         Node current = head;
  41.         while (current.next.data != data) {
  42.             current = current.next;
  43.         }
  44.         current.next = current.next.next;
  45.         return;
  46.     }
  48.     public void printAll() {
  49.         Node current;
  50.         for (current = head; current.next != null; current = current.next) {
  51.             System.out.println(current.data);
  52.         }
  53.         System.out.println(current.data);
  54.         return;
  55.     }
  57.     public static void main(String[] args) {
  58.         LinkedListLogic a = new LinkedListLogic();
  59.         a.addToLastElement(2);
  60.         a.addToLastElement(4);
  61.         a.insertAtBeginning(5);
  62.         a.deleteAtSpecificValue(2);
  63.         a.addToLastElement(9);
  64.         a.addToLastElement(9);
  65.         a.addToLastElement(9);
  66.         a.addToLastElement(9);
  67.         a.deleteAtSpecificValue(9);
  68.         a.printAll();
  69.     }
  70. }
英文:

Thanks to Andy Turner for pointing out the errors

  1. public class LinkedListLogic {
  2. private class Node {
  3. Node next;
  4. int data;
  5. public Node(int data) {
  6. this.data = data;
  7. }
  8. }
  9. Node head;
  10. public void addToLastElement(int data) {
  11. if (head == null) {
  12. head = new Node(data);
  13. return;
  14. }
  15. Node current = head;
  16. while (current.next != null) {
  17. current = current.next;
  18. }
  19. current.next = new Node(data);
  20. }
  21. public void insertAtBeginning(int data) {
  22. Node newHead = new Node(data);
  23. newHead.next = head;
  24. head = newHead;
  25. }
  26. public void deleteAtSpecificValue(int data) {
  27. if (head == null) {
  28. return;
  29. }
  30. if (head.data == data) {
  31. head = head.next;
  32. }
  33. Node current = head;
  34. while (current.next.data != data) {
  35. current = current.next;
  36. }
  37. current.next = current.next.next;
  38. return;
  39. }
  40. public void printAll() {
  41. Node current;
  42. for (current = head; current.next != null; current = current.next) {
  43. System.out.println(current.data);
  44. }
  45. System.out.println(current.data);
  46. return;
  47. }
  48. public static void main(String[] args) {
  49. LinkedListLogic a = new LinkedListLogic();
  50. a.addToLastElement(2);
  51. a.addToLastElement(4);
  52. a.insertAtBeginning(5);
  53. a.deleteAtSpecificValue(2);
  54. a.addToLastElement(9);
  55. a.addToLastElement(9);
  56. a.addToLastElement(9);
  57. a.addToLastElement(9);
  58. a.deleteAtSpecificValue(9);
  59. a.printAll();
  60. }
  61. }

答案2

得分: 0

  1. public class LinkedListLogic  {
  3.     private class Node {
  4.         Node next;
  5.         int data;
  7.         public Node(int data) {
  8.             this.data = data;
  9.         }
  10.     }
  12.     Node head;
  14.     public void addToLastElement(int data) {
  15.         if (head == null) {
  16.             head = new Node(data);
  17.             return;
  18.         }
  19.         Node current = head;
  20.         while (current.next != null) {
  21.             current = current.next;
  22.         }
  23.         current.next = new Node(data);
  24.     }
  26.     public void insertAtBeginning(int data) {
  27.         Node newHead = new Node(data);
  28.         newHead.next = head;
  29.         head = newHead;
  30.     }
  32.     public void deleteAtSpecificValue(int data) {
  33.         if (head == null) {
  34.             return;
  35.         }
  37.         Node current = head;
  38.         Node previous = null;
  39.         while (current != null && current.data != data) {
  40.             previous = current;
  41.             current = current.next;
  42.         }
  43.         if (current != null && current.data == data) {
  44.             previous.next = current.next;
  45.         }
  46.         return;
  47.     }
  49.     public void printAll() {
  50.         for (Node current = head; current != null; current = current.next) {
  51.             System.out.print(current.data + " ");
  52.         }
  53.         System.out.println();
  54.         return;
  55.     }
  57.     public static void main(String[] args) {
  58.         LinkedListLogic a = new LinkedListLogic();
  59.         a.addToLastElement(2);
  60.         a.addToLastElement(4);
  61.         a.addToLastElement(6);
  62.         a.addToLastElement(9);
  63.         a.printAll();
  64.         a.insertAtBeginning(1);
  65.         a.printAll();
  66.         a.deleteAtSpecificValue(6);
  67.         a.printAll();
  68.         a.deleteAtSpecificValue(9);
  69.         a.printAll();
  70.     }
  72. }
英文: 
  1. public class LinkedListLogic  {
  2. private class Node {
  3. Node next;
  4. int data;
  5. public Node(int data) {
  6. this.data = data;
  7. }
  8. }
  9. Node head;
  10. public void addToLastElement(int data) {
  11. if (head == null) {
  12. head = new Node(data);
  13. return;
  14. }
  15. Node current = head;
  16. while (current.next != null) {
  17. current = current.next;
  18. }
  19. current.next = new Node(data);
  20. }
  21. public void insertAtBeginning(int data) {
  22. Node newHead = new Node(data);
  23. newHead.next = head;
  24. head = newHead;
  25. }
  26. public void deleteAtSpecificValue(int data) {
  27. if (head == null) {
  28. return;
  29. }
  30. Node current = head;
  31. Node previous = null;
  32. while ( current != null && current.data != data) {
  33. previous = current;
  34. current = current.next;
  35. }
  36. if(current != null && current.data == data) {
  37. previous.next = current.next;
  38. }
  39. return;                           
  40. }
  41. public void printAll() {
  42. for (Node current = head; current != null; current = current.next) {
  43. System.out.print(current.data+" ");
  44. }
  45. System.out.println();
  46. return;
  47. }
  48. public static void main(String[] args) {
  49. LinkedListLogic  a = new LinkedListLogic ();
  50. a.addToLastElement(2);
  51. a.addToLastElement(4);
  52. a.addToLastElement(6);
  53. a.addToLastElement(9);
  54. a.printAll();
  55. a.insertAtBeginning(1);
  56. a.printAll();
  57. a.deleteAtSpecificValue(6);
  58. a.printAll();
  59. a.deleteAtSpecificValue(9);
  60. a.printAll();
  61. }
  62. }

huangapple
  • 本文由 发表于 2020年9月2日 03:08:18
  • 转载请务必保留本文链接：https://go.coder-hub.com/63693958.html
  • java
  • linked-list
匿名

发表评论

匿名网友

:?: :razz: :sad: :evil: :!: :smile: :oops: :grin: :eek: :shock: :???: :cool: :lol: :mad: :twisted: :roll: :wink: :idea: :arrow: :neutral: :cry: :mrgreen:

确定