一个C++程序编译和连接都正确，
#include
typedef struct NODE
{
float data;
struct NODE *next;
}ListNode;
ListNode *CreatList(int *n);
void InsertNode(ListNode *phead,int *n);
void BubbleSort(ListNode *phead,int n);
void DispList(ListNode *phead);
void FreeList(ListNode *phead);
void main()
{
int iNumLN = 0;
ListNode * phead = Cr...全部
#include
typedef struct NODE
{
float data;
struct NODE *next;
}ListNode;
ListNode *CreatList(int *n);
void InsertNode(ListNode *phead,int *n);
void BubbleSort(ListNode *phead,int n);
void DispList(ListNode *phead);
void FreeList(ListNode *phead);
void main()
{
int iNumLN = 0;
ListNode * phead = CreatList(&iNumLN);
std::cout >pos;
if (pos == 1)
{
std::cout > fl;
if (phead == NULL)
{
phead = new ListNode;
phead->data = fl;
phead->next = NULL;
p = phead;
}
else
{
while(p->next != NULL && m next;
m ++;
}
ListNode *r = new ListNode;
r->data = fl;
if (p->next == NULL)
{
r->next = NULL;
p->next = r;
p = phead;
}
else
{
r->next = p->next;
p->next = r;
p = phead;
}
}
}
std::cout next != NULL)
{
Sp = Fp->next;
while(Sp != NULL)
{
if (Sp->data data)
{
tempData = Fp->data;
Fp->data = Sp->data;
Sp->data = tempData;
}
Sp = Sp->next;
}
Fp = Fp->next;
}
}
ListNode * CreatList(int *n)
{
ListNode *phead = NULL;
ListNode *pcur = NULL;
float fl;
std::cout > fl;
if (fl == 1)
{
std::cout data = fl;
pcur->next = NULL;
*n = *n + 1;
while (1)
{
std::cin >> fl;
if (fl == 1)
{
std::cout data = fl;
s->next = NULL;
pcur->next = s;
pcur = pcur->next;
*n = *n + 1;
}
return phead;
}
void DispList(ListNode *phead)
{
ListNode *p = phead;
if (p == NULL)
{
std::cout data next;
}
}
std::cout next;
delete p;
p = phead;
}
std::cout << "释放已经分配的链表" << std::endl;
}。
收起
