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

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

int main() {
    int n ;

    while (cin >> n ) {
        vector<int> array; //用数组模拟链表
        // array.push_back(head);
        for (int i = 0; i < n; i++) {
            int num;
            cin >> num ; //输入要插入的数和它要插入哪个数字后面
            array.push_back(num);
        }
        int remove;
        cin >> remove;
        remove = array.size() -  remove ;
            cout << array[remove] << endl;
    }
    return 0;
}