双向循环链表的插入操作_6-2 循环双链表插入操作分数 10全屏浏览题目切换布局作者 王东单位 贵州师范学院

#include <iostream>
using namespace std;

typedef struct LNode{
	int data;
	struct LNode *pre,*next;
}Node, *LinkList;

void Init_Linklist(LinkList &s){
	s = new Node;
	s->next = s->pre = NULL;
}

void create_LinkList(LinkList &s,int n){
	Node *p,*r;
	r = s;
	
	for(int i=0;i<n;i++){
		p = new Node;
		p->data = i+1;
		p->next=p->pre=NULL;
		
		r->next = p;
		p->pre = r;
		r = p;
	}
	r->next = s;
	s->pre = r;
}

int insert_Node(LinkList &s,int n,int elem){
	
	Node *p = s;
	
	int i=1;
	while(p && i<n){
		p = p->next;
		i++;
	} 
	
	if(!p)
		return -1;
	
	Node *q = new Node;
	q->data = elem;
	q->pre = q->next = NULL;
	
	if(!p->next)
	{
		p->next = q;
		q->pre = p;
		q->next = s;
		s->pre = q;
	}
	else{
		q->pre = p;
		q->next = p->next;
		p->next->pre = q;
		p->next = q;
	}

	
	
}

void show(LinkList s){
	Node *p = s->next;
	while(p){
		cout<<p->data<<" ";
		p = p->next;
	}
}

int main(){
	
	LinkList s;
	Init_Linklist(s);
	create_LinkList(s,5);
	insert_Node(s,6,10);
	//show(s);
	cout<<s->pre->data;
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83