#include <iostream> using namespace std; struct ListNode { int m_nKey; ListNode *m_pNext; ListNode() : m_nKey(0), m_pNext(nullptr){}; ListNode(int x) : m_nKey(x), m_pNext(nullptr){}; }; ListNode *searchNode(ListNode *head, int &node_num) { int i = 0; ListNode *node_i = head; ListNode *node_ii = head; for (; i < node_num; i++) { if (!node_i->m_pNext) { return NULL; } node_i = node_i->m_pNext; } while (node_i) { node_ii = node_ii->m_pNext; } return node_ii; } int main() { int node_num, node; while (cin >> node_num) { ListNode *head = new ListNode(); //正序构建链表 ListNode *pre_head = head; while (node_num--) { cin >> node; ListNode *next = new ListNode(node); head->m_pNext = next; head = next; } cin >> node_num; res = searchNode(pre_head, node_num); done: if (res != NULL) cout << res->m_nKey << endl; else cout << "0" << endl; } return 0; }</iostream>