题解 | 输出单向链表中倒数第k个结点

#include <iostream>
#include <list>
using namespace std;

struct ListNode
{
    int val;
    ListNode* m_pNext;
};

int main() {
    int n;
    while(cin>>n){
    ListNode* index = new ListNode();
    ListNode* head = index;
    //cin>>n;
    for(int i = 0; i<n; i++){
        int val;
        cin>>val;
        index->m_pNext = new ListNode();
        index = index->m_pNext;
        index->val = val;
    }
    int k;
    cin>>k;
    for(int j = 0; j<n-k+1;j++){
        //cout<<head->val;
        head = head->m_pNext;
    }
    cout<<head->val<<endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")