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

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

int main() {
    int n, k;
    while(cin >> n) {
        vector<int> lists(n);
        for(int i = 0; i < n; ++i) {
            cin >> lists[i];
        }
        cin >> k;
        cout << lists[n - k] << endl;
    }   
    return 0;
}