#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 p = L->next;
int j = 1;
while (j < k && p)
{
p = p->next;
j++;
}
if (!p || j > k)
{
cout << "错误" << endl;
return;
}
cout << "第" << k << "个数为:" << p->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, k;
while (cin >> n && n)
{
CreatTail(L, n);
Printlist(L);
cin >> k;
Find_k(L, k);
}
return 0;
}
按序号查找(c++)
于 2022-03-28 14:43:05 首次发布