1、计算出整个链表长度,如果链表长度等于k,直接返回head.next;
2、双指针 fast 和 slow 让fast先走k-1步,为了让下一步遍历结束后slow正好再被删结点的前一个位置,需要让fast再走一步,。
3、两个指针同时开始走,每次一步,遍历结束,让slow的next指向下下个结点。
public ListNode removeNthFromEnd(ListNode head, int n) {
if(head==null) {
return null;
}
ListNode fast = head;
ListNode slow = head;
ListNode cur = head;
int count = 0;
while(cur!=null) {
count++;
cur = cur.next;
}
cur = head;
if(count == n) {
head = head.next;
return head;
}
for(int i=0;i<n;i++) {
fast = fast.next;
}
fast = fast.next;
while(fast!=null) {
fast = fast.next;
slow = slow.next;
}
ListNode del = slow.next;
slow.next = del.next;
return head;
}