-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest4.cpp
More file actions
184 lines (159 loc) · 2.72 KB
/
test4.cpp
File metadata and controls
184 lines (159 loc) · 2.72 KB
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef struct Node
{
int data;
struct Node* pNext;
}NODE,*PNODE;
PNODE create_list()
{
int len;
int i;
int input;
PNODE pHead = (PNODE)malloc(sizeof(NODE));
if (pHead == NULL)
{
printf("动态内存分配失败");
}
PNODE pTail = pHead;
pTail->pNext = NULL;
printf("请输入链表长度为len=\n ");
scanf_s("%d", &len);
for ( i = 0; i < len; i++)
{
printf("请输入第%d个结点的值", i + 1);
scanf_s("%d", &input);
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if (pNew == NULL)
{
printf("动态内存分配失败");
}
/*pNew->data = input;
pTail->pNext = pNew;
pTail = pNew;
pTail->pNext = NULL;*/
pNew->data = input;
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;
}
return pHead;
}
void traverse_list(PNODE pHead)
{
PNODE p = pHead->pNext;
while (p!=NULL)
{
printf("%d ", p->data);
p = p->pNext;
}
}
bool is_empty(PNODE pHead)
{
if (pHead->pNext == NULL)
return true;
else
return false;
}
int length_list(PNODE pHead)
{
/*int length=0;
while (pHead->pNext!=NULL)
{
pHead = pHead->pNext;
length++;
}
return length;*/
PNODE p = pHead->pNext;
int length = 0;
while (p!=NULL)
{
p = p->pNext;
length++;
}
return length;
}
bool insert_list(PNODE pHead, int pos, int val)
{
PNODE p = pHead;
int i = 0;
while (p!=NULL && i>pos-1)
{
p = p->pNext;
i++;
}
if (p == NULL || pos<1)
return false;
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if (pNew == NULL)
{
printf("动态内存分配失败");
}
pNew->data = val;
PNODE q = p->pNext;
p->pNext = pNew;
pNew->pNext = q;
return true;
}
bool delete_list(PNODE pHead, int pos, int* e)
{
PNODE p=pHead;
int i = 0;
while (p->pNext!=NULL && i<pos-1 )
{
p = p->pNext;
i++;
}
if (p->pNext == NULL || i > pos - 1)
return false;
PNODE q = p->pNext;
*e = q->data;
p->pNext = q->pNext;
free(q);
q = NULL;
return true;
}
void sort_list(PNODE pHead)
{
int i, j, t;
int length = length_list(pHead);
PNODE p, q;
for (i = 0,p=pHead->pNext; i < length-1; i++,p=p->pNext)
{
for (j = i+1,q=p->pNext; j < length; j++,q=q->pNext)
{
if (p->data > q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
}
}
}
int main()
{
PNODE pHead = NULL;
int list_len;
//初始化链表
pHead = create_list();
int e;
//printf("%d \n", pHead->pNext->pNext->data);
//遍历链表
/*traverse_list(pHead);
list_len = length_list(pHead);
printf("当前链表的长度为%d\n", list_len);*/
// printf("%d ", pHead->pNext->pNext->data);
//if (insert_list(pHead, 3, 4))
// printf("插入成功\n");
//else
//{
// printf("插入失败");
//}
//traverse_list(pHead);
/*delete_list(pHead,2,&e);
traverse_list(pHead);*/
sort_list(pHead);
traverse_list(pHead);
}