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

牛客第一次写题解

#include<string>
#include<algorithm>
using namespace std;
int main(){
    int N,headV;
    while(cin>>N>>headV){
        if(N==0)
            break;
        vector<int>arr;
        arr.push_back(headV);
        for(int i=0;i<N-1;i++){
            int back,front;
            cin>>back>>front;
            vector<int>::iterator it=find(arr.begin(),arr.end(),front);
            if(it!=arr.end())
                arr.insert(it+1, back);
            else
                arr.push_back(back);
        }
        int remove;
        cin>>remove;
        arr.erase(find(arr.begin(),arr.end(),remove));
        for(auto i:arr){
            cout<<i<<" ";
        }
        cout<<endl;
    }
    return 0;
}

```