力扣：19. 删除链表的倒数第 N 个结点

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
       ListNode head1=head;
        int length=0;
        while(head1!=null)
        {
            
            head1=head1.next;
            length++;
        }
        head1=head;
        int i=0;
        while(head1!=null&&i<length-n-1)
        {
            head1=head1.next;
            i++;
        }
        
        
        if(head1.next!=null&&length-n-1>=0)
        {
            head1.next=head1.next.next;
        }
        else if(head1.next!=null&&length-n-1<0)
        {
           
            head=head1.next;
        }

        if(length==1)
        {
            ListNode head2=null;
            return head2;
        }
        else
        {
            return head;
        }
       
        
    }

    }