#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_e(LinkList L, int e)
{
LinkList p = L->next;
while (p->data != e && p)
{
p = p->next;
}
if (p->data == e)
cout << "查找成功" << endl;
else
cout << "查找失败" << 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;
while (cin >> n && n)
{
CreatTail(L, n);
Printlist(L);
cin >> e;
Find_e(L, e);
}
return 0;
}
按值查找(c++)
于 2022-03-28 14:58:36 首次发布