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

#include <bits/stdc++.h>
using namespace std;
struct ListNode {
    int m_nKey;
    ListNode* m_pNext;
};
int main() {
    int count, key, k;
    stack<ListNode*> vt;
    while (cin >> count) { // 注意 while 处理多个 case
        for (int i = 0; i < count; ++i) {
            ListNode* p = new ListNode;
            cin >> key;
            p->m_nKey = key;
            vt.push(p);
        }
        cin >> k;
        for (int i = 0; i < k - 1; i++) {
            vt.pop();
        }
        cout << vt.top()->m_nKey << endl;
    }
    return 0;
}