0706第七讲标准模版库(2)链表
1、定义:是一个不连续的存储结构,元素之间通过指针进行连接,每个元素称为节点
2、节点:包含两部分,数据域和指针域(指向下一个节点)
3、访问:指针从头节点进行访问,
4、分类:单向链表,双向链表,循环链表
单向链表:数据域,指针域(尾指针)
双向链表:数据域,指针域(头指针,尾指针)
循环链表:数据域,指针域(尾指针),尾节点指向首节点,构成循环
课堂作业:
//找到中间节点
typedef struct Node{
int num;
struct Node* link;
}student;
student* middleNode(student* head){
student* p1Node = head;
student* p2Node = head->link;
int count = 1;
if (p2Node == NULL) {
return head;
}
while (p2Node != NULL) {
count++;
p1Node = p2Node;
p2Node = p2Node->link;
}
p1Node = head;
for (int i = 0; i < count/2; ++i) {
p1Node = p1Node->link;
}
return p1Node;
}
//连接两个链表
student* catNode(student* head1,student* head2){
student* pNode = head1;
while (pNode->link!=NULL) {
pNode = pNode->link;
}
pNode->link = head2;
return head1;
}
//将链表逆序
student* reversedNode(student* head){
student* p1Node = head->link;
student* p2Node = p1Node->link;
student* p3Node = p2Node->link;
head->link->link = head;
head->link= NULL;
while (p2Node->link!= NULL) {
p2Node->link = p1Node;
p1Node = p2Node;
p2Node = p3Node;
p3Node = p3Node->link;
}
p2Node->link = p1Node;
return p2Node;
}
//视频:舞动的排序算法(冒泡、插入、选择、快速)