Pointer linked list

Pointer list

First in first out linked list

hold p Pointer to L The head pointer of , Then create q Pointer space , Assign a value , And then p The next bit of the pointer takes q, And then put p Pointer backward , Add one at the end p->next=NULL;

#include<bits/stdc++.h>
#define bug(a) (cout<<'*'<<a<<endl)
using namespace std;
typedef struct node
{
    
	int data;
	node* next;
}*linklist;
void create(linklist& L, int n)
{
    
	linklist p, q;
	int num;
	L = (linklist)malloc(sizeof(node));
	p = L;
	while (n--)
	{
    
		q = (linklist)malloc(sizeof(node));
		scanf("%d", &num);
		q->data = num;
		p->next = q;
		p = p->next;
	}
	p->next = NULL;
}
void print(linklist L)
{
    
	L = L->next;
	while (L)
	{
    
		printf("%d", L->data);
		if (L->next != NULL)
			printf(" -> ");
		L = L->next;
	}
	printf("\n");
}
int main()
{
    
	linklist l;
	printf(" Please enter the number of nodes to create \n");
	int n, num;
	scanf("%d", &n);
	printf(" Please enter the values of the nodes in turn \n");
	create(l, n);
	print(l);
	return 0;
}

First in and last out linked list pointer

The first in and then out linked list is the opposite , First p=NULL; And then to q Create space to give value , Re order q->next=p; Always be the first , Want to be upside down .

 Insert it here #include<bits/stdc++.h>
#define bug(a) (cout<<'*'<<a<<endl)
using namespace std;
typedef struct node
{
    
	int data;
	node* next;
}*linklist;
void create(linklist& L, int n)
{
    
	linklist p, q;
	p = NULL;
	int num;
	while (n--)
	{
    
		q = (linklist)malloc(sizeof(node));
		scanf("%d", &num);
		q->data = num;
		q->next = p;
		p = q;// From the back to the front 
	}
	L = (linklist)malloc(sizeof(node));
	L->next = p;
}
void print(linklist L)
{
    
	L = L->next;
	while (L)
	{
    
		printf("%d", L->data);
		if (L->next != NULL)
			printf(" -> ");
		L = L->next;
	}
	printf("\n");
}
int main()
{
    
	linklist l;
	printf(" Please enter the number of nodes to create ( First in, then out )\n");
	int n, num;
	scanf("%d", &n);
	printf(" Please enter the values of the nodes in turn \n");
	create(l, n);
	print(l);
	return 0;
}