目录
typedef struct Node {
int data;
struct Node* pNext;
}NODE,*PNODE;
创建
PNODE create_list() {
//listNode length.
int len;
//listNode value.
int value;
//Init linkedlist length.
printf("Please input list long:");
scanf("%d", &len);
//Allocate memory.
PNODE pHead = (PNODE)malloc(sizeof(NODE));
//Create lastNode.
PNODE pTail = pHead;
//Clear pointer field.
pTail->pNext = NULL;
//number len.
for (int i = 0; i < len; i++)
{
//input.
printf("Please input %d value.", i + 1);
scanf("%d", &value);
//Assignment.
PNODE pNew = (PNODE)malloc(sizeof(NODE));
//Assign value.
pNew->data = value;
//linked.
pTail->pNext = pNew;
//clear pNew pointer field.
pNew->pNext = NULL;
//pNew is last.
pTail = pNew;
}
retu