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

难度: 🌗

问题描述

---

解法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        // 思路：
        // 快慢指针，先走 k 步
        ListNode fast = head;
        for(int i = 0; i < k; i ++) {
            fast = fast.next;
        }
        ListNode cur = head;
        while(fast != null) {
            fast = fast.next;
            cur = cur.next;
        }
        return cur;
    }
}

---

输出