[the penultimate node in the linked list]

---

One 、 Title Description

describe

Enter a linked list , Output the last number in the list k Nodes .

Example 1

Input ：1,{1,2,3,4,5}
Return value ：{5}

Topic link

---

Two 、 Provide easy to read code diagram

---

3、 ... and 、 Title code

Ideas ：fast Go ahead k Step , then slow And fast Let's go together again .fast==NULL when ,slow It's the last k individual

/** * struct ListNode { * int val; * struct ListNode *next; * }; * * C Language declaration defines global variables. Please add static, Prevent duplicate definitions  * * C Language declaration defines global variables. Please add static, Prevent duplicate definitions  */

/** * * @param pListHead ListNode class  * @param k int integer  * @return ListNode class  */
struct ListNode* FindKthToTail(struct ListNode* pListHead, int k ) {
    
    // write code here
    struct ListNode* fast=pListHead;
    struct ListNode* slow=pListHead;
    while(k--)
    {
    
        if(fast==NULL)
            return NULL;
        fast=fast->next;
    }
    while(fast)
    {
    
        fast=fast->next;
        slow=slow->next;
    }
    return slow;
}

---

The above is the whole content of this article , If there are mistakes in the article or something you don't understand , Communicate more with meow bloggers . Learn from each other and make progress . If this article helps you , Can give meow bloggers a concern , Your support is my biggest motivation .