代码随想录打卡day4

原文链接

Problem: 19. 删除链表的倒数第 N 个结点

思路

1. 暴力法，先求长度，再用len-n得到待删除的前一个结点
2. 快慢指针

解题方法

[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-nNJFmpfa-1679156595072)(https://pic.leetcode.cn/1679151288-xLkpGE-%E5%BE%AE%E4%BF%A1%E5%9B%BE%E7%89%87_20230318225431.jpg)]

复杂度

• 时间复杂度:

$O(n)$

• 空间复杂度:

$O(1)$

Code

/**
 * 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) {
        int cnt = 0;
        ListNode dummyHead = new ListNode(-1,head);
        ListNode cur = dummyHead;
        int index = -1; //删除的前一个结点下标
        while(cur.next != null){
            cur = cur.next;
            cnt++;
        }
        index = cnt - n;
        cur = dummyHead;
        while(index-- != 0){
            cur = cur.next;
        }
        cur.next = cur.next.next;
        return dummyHead.next;
    }
}
//快慢指针法
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode dummyHead = new ListNode(-1,head);
        ListNode fast = dummyHead;
        ListNode slow = dummyHead;
        n++;
        while(n-- != 0){
            fast = fast.next;
        }
        while(fast != null){
            fast = fast.next;
            slow = slow.next;
        }
        slow.next = slow.next.next;
        return dummyHead.next;
    }
}