题解 | #链表中倒数第k个结点#单循环加判断，针对用例

/**
 * struct ListNode {
 *  int val;
 *  struct ListNode *next;
 * };
 */

/**
 *
 * @param pListHead ListNode类
 * @param k int整型
 * @return ListNode类
 */
struct ListNode* FindKthToTail(struct ListNode* head, int k ) {

    struct ListNode* fast = head;
    struct ListNode* show = head;
    while (head != NULL) {

        if (k > 0) {
            k--;
        } else {
            show = show->next;
        }
        fast = fast->next;
        head = head->next;
    }
    if (k == 0) {
        return show;
    } else {
        show = NULL;
        return show;
    }
}