Purpose:
Delete the intermediate node of the linked list
(Recommended tutorial:java course)
Code implementation:
public class Node{ public int value; public Node next; public Node(int data){ this.value=data; } } public Node removeMidNode(Node head){ if(head==null||head.next==null){ return head; } if(head.next.next==null){ return head.next; } Node pre=head; Node cur=head.next.next; while(cur.next!=null&&cur.next.next!=null){ pre.pre.next; cur=cur.next.next; } pre.next=pre.next.next; return head; }
Related recommendations:Getting started with java
The above is the detailed content of Java implements deleting the intermediate node of a linked list. For more information, please follow other related articles on the PHP Chinese website!