#include<iostream>
using namespace std;
typedef struct LNode
{
int data;
struct LNode* next;
}LNode, * LinkList;
void CreatTail(LinkList& L, int n)
{
L = new LNode;
L->next = NULL;
LinkList r = L;
while (n--)
{
LinkList p = new LNode;
cin >> p->data;
p->next = NULL;
r->next = p;
r = p;
}
}
void Find_k(LinkList L, int k)
{
LinkList fast = L, slow = L;
while (k--)
{
fast = fast->next;
}
while (fast)
{
fast = fast->next;
slow = slow->next;
}
cout << slow->data << endl;
}
void Printlist(LinkList L)
{
LinkList p = L->next;
while (p->next)
{
cout << p->data << " ";
p = p->next;
}
cout << p->data;
cout << endl;
}
int main()
{
LinkList L;
int n, e, k;
while (cin >> n && n)
{
CreatTail(L, n);
Printlist(L);
cin >> k;
Find_k(L, k);
}
return 0;
}
倒数第k个数(c++)
于 2022-03-28 16:24:24 首次发布