剑指offer Dynamic Programming

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

Posted by franki on April 25, 2021

链表中倒数第k个节点

输入一个链表，输出该链表中倒数第k个节点。

思路

双指针

1 第一个指针先走k步

2 第二个指针从头结点开始走，第一个指针同步走

3 当第一个指针走到结尾时

4 返回当前第二个指针指向的位置

代码

function getKthFromEnd(head, k) {
    if (head === null || k === 0) {
        return null;
    }
    let paHead = head;
    let pbHead = head;

    let index = 0;
    while (index++ < k) {
        if (paHead === null) {
            return null;
        }
        paHead = paHead.next;
    }

    while (paHead) {
        paHead = paHead.next;
        pbHead = pbHead.next;
    }

    return pbHead;
}

复杂度分析

  • 时间复杂度: O(N)
  • 空间复杂度: O(1)
CATALOG
    FEATURED TAGS
    前端开发 H5 JavaScript 设计模式 browser jQuery 源码分析 生活 leetcode Array Stack Queue Linked List 剑指offer Binary Search Tree Binary Tree Breadth-First Search Depth-First Search String Set Binary Search Sliding Window Backtracking Dynamic Programming Two Pointers Union Find Sort Bit Operation Recursion Map Graph Search Hash LinkedList 复盘 QuickSort Trie Design MinHeap Traverse Min Heap Node.js BackEnd SQL MySQL Design Patterns Network 计算机网络 Python SVG
    FRIENDS