华为机试 HJ51题解 | #输出单向链表中倒数第k个结点#

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

int main() {
    int n;
    while (cin >> n) { // 注意 while 处理多个 case
        std::vector<int> nVec;
        for (int i = 0; i < n; i++) {
            int num;
            cin >> num;
            nVec.push_back(num);
        }
        int k;
        cin >> k;
        cout << nVec[n - k] << endl;
    }
}