java实现---删除一个无头单链表的非尾节点（不能遍历链表）

• 可以利用伪删除法

1. 把pos.next的值覆给pos
2. pos的next指向pos.next的next
3. 删除pos.next

class ListNode{
    int data;
    ListNode next;
}
public class Link{
    public static void DeleteListNotTail(ListNode pos) {
        if (pos == null || pos.next == null) {
            return;
        }
            ListNode del = pos.next;
            pos.data = del.data;
            pos.next = del.next;
            del = null;

    }
       public static void print(ListNode head){
        while(head != null){
            System.out.println(head.data);
            head = head.next;
        }
   }
    public static void main(String[] args) {
        ListNode n1 = new ListNode();
        ListNode n2 = new ListNode();
        ListNode n3 = new ListNode();
        ListNode n4 = new ListNode();
        n1.data = 1;
        n2.data = 2;
        n3.data = 3;
        n4.data = 4;
        n1.next = n2;
        n2.next = n3;
        n3.next = n4;
        DeleteListNotTail(n2);
        print(n1);
    }
}