关注公众号程序猿从入门到入土查询更方便哦
随机产生或键盘输入一组元素,建立一个带头结点的单向链表(无序),遍历单向链表,显示相应元素
#include<bits/stdc++.h>
#define RESULT int
#define OK 1
#define ERROR 0
using namespace std;
typedef struct Node {
int data;
Node *next;
}LNode, *LinkList;
RESULT InitList(LinkList &L); //初始化链表
RESULT InsertData_Back(LinkList &L, int data); //尾插
RESULT Output_LinkList(LinkList& L); //打印链表
int main() {
LinkList L = new LNode;
InitList(L);
int n = 0;
while(cin>>n){
if(n!=0){
InsertData_Back(L,n);
}
else{
Output_LinkList(L);
InitList(L);
break;
}
}
return 0;
}
RESULT InitList(LinkList &L) {
L = new LNode;
L->next = NULL;
return OK;
}
RESULT InsertData_Back(LinkList &L, int data) {
LinkList temp = new LNode;
temp->data = data;
temp->next = NULL;
LinkList p = L;
while (p->next != NULL) {
p = p->next;
}
p->next = temp;
return OK;
}
RESULT Output_LinkList(LinkList& L) {
LinkList temp = L->next;
while (temp != NULL) {
cout << temp->data<<" ";
temp = temp->next;
}
printf("\n");
return OK;
}