Java链表中倒数第k个节点、删除链表中倒数第N个节点(快慢指针)

不想秃头Q-Q

已于 2022-07-10 17:30:05 修改

阅读量236

点赞数

分类专栏：剑指offer 文章标签：链表 java leetcode

于 2022-05-17 10:57:55 首次发布

本文链接：https://blog.csdn.net/LX__dream/article/details/124816606

版权

剑指offer 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

剑指offer 19.删除链表中倒数第N个节点

解题思路1:

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode fast = head, slow = head;
        for(int i = 0; i < n; i++){
            fast = fast.next;
        }
        if(fast == null){
            return head.next;
        }
        while(fast.next != null){
            fast = fast.next;
            slow = slow.next;
        }
        slow.next = slow.next.next;
        return head;
    }
}

解题思路2

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode tmp = new ListNode(0, head);
        int len = 0;
        while(tmp.next != null){
            len++;
            tmp = tmp.next;
        }
        ListNode node = new ListNode(0, head);
        int count = 1;
        while(true){
            if(n == len){
                node.next = head.next;
                break;
            }else if(count == len - n){
                head.next = head.next.next;
                break;
            }
            head = head.next;
            count++;
        }
        return node.next;
    }
}

剑指offer 22.链表中倒数第k个节点

解题思路1
快慢指针
让快指针先走k步, 当fast = null时, slow指针刚好指向链表中倒数第k个节点

class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        ListNode fast = head, slow = head;
        for(int i = 1; i <= k; i++){
            fast = fast.next;
        }
        while(fast != null){
            fast = fast.next;
            slow = slow.next;
        }
        return slow;
    }
}

解题思路2:
遍历链表, 统计链表的长度count
链表中倒数第k个节点 = 从头开始遍历count - k + 1个节点处

class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        if(head == null && head.next == null){
            return head;
        }
        int count = 0;
        ListNode p = head;
        while(p.next != null){
            count++;
            p = p.next;
        }
        for(int i = 1; i <= count - k + 1; i++){
            head = head.next;
        }
        return head;
    }
}

//或者令指针p为傀儡节点
class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        if(head == null && head.next == null){
            return head;
        }
        int count = 0;
        ListNode p = new ListNode(0, head);
        while(p.next != null){
            count++;
            p = p.next;
        }
        for(int i = 1; i <= count - k; i++){
            head = head.next;
        }
        return head;
    }
}