【leetcode】链表中倒数第k个节点

struct ListNode* getKthFromEnd(struct ListNode* head, int k){
    struct ListNode* pNode = head;
    for (int i = 0; i < k; ++i) {
        pNode = pNode->next;
    }

    while (pNode != NULL) {
        pNode = pNode->next;
        head = head->next;
    }

    return head;
}