1.全局变量的未初始化的数值一般都被系统初始化为0
局部变量的未初始化数值一般都被系统初始化为随机值, 主函数在栈区分配空间,无论是全局指针,全局数组,字符数组,整型数组,double数组,全局结构体变量未初始化,都在.bss区域初始化。
数据区:字符串常量区(只读数据区),未初始化区域(.bss区域),已初始化区域。
2.购买链表节点函数
ListNode* Buynode()
{
ListNode* s = (ListNode*)malloc(sizeof(ListNode));
if (nullptr == s) exit(1);
memset(s, 0, sizeof(ListNode));
return s;
}
3.链表初始化函数
void Init_List(LinkList* plist)
{
assert(plist != nullptr);
plist->head = Buynode();
plist->cursize = 0;
}
4.查找链表中某个数值,返回此下标
ListNode* FindValue(LinkList* plist, ElemType val)
{
assert(plist != nullptr);
ListNode* p = plist->head->next;
while (p != nullptr && p->data != val)
{
p = p->next;
}
return p;
}
5.打印出链表中数值
void Print_List(LinkList* plist)
{
assert(plist != nullptr);
ListNode* p = plist->head->next;
while (p != nullptr);
{
printf("%5d", p->data);
p = p->next;
}
printf("\n");
}
6.删除链表中某一个数值
bool Erase_Item(LinkList* plist, int pos)
{
assert(plist != nullptr);
ListNode* pre = FindPos_Pre(plist, pos);
if (pre == nullptr || pre->next == nullptr)return false;
ListNode* q = pre->next;
pre->next = q->next;
free(q);
q = nullptr;
plist->cursize -= 1;
return true;
}
7.查找链表中某一个数值的节点
ListNode* Findpos(LinkList* plist, int pos)
{
assert(plist != nullptr);
if (pos<1 || pos>plist->cursize) return nullptr;
ListNode* p = plist->head->next;
int i = 1;
while (i < pos)
{
p = p->next;
++i;
}
return p;
}
8.查找链表中某一个数值,返回它的上一个结点的位置
ListNode* FindPos_Pre(LinkList* plist, int pos)
{
assert(plist != nullptr);
if (pos<1 || pos>plist->cursize+1) return nullptr;
ListNode* p = plist->head;
int i = 1;
while (i < pos)
{
p = p->next;
++i;
}
return p;
}
9.在链表中某个位置插入元素
bool Insert_Item(LinkList* plist, int pos, ElemType val)
{
assert(plist != nullptr);
ListNode* p = FindPos_Pre(plist, pos);
if (p == nullptr) return false;
ListNode* s = Buynode();
s->data = val;
s->next = p->next;
p->next = s;
plist->cursize += 1;
return true;
}
10.在链表最前边插入元素,在链表最后边插入元素,在链表中某个位置插入数组
void push_back(LinkList* plist, ElemType val)
{
Insert_Item(plist, plist->cursize + 1, val);
}
void push_front(LinkList* plist, ElemType val)
{
Insert_Item(plist, 1, val);
}
void Insert_Ar(LinkList* plist, int pos, ElemType* ar, int n)
{
for (int i = 0; i < n; ++i)
{
Insert_Item(plist, pos, ar[i]);
}
}
11.主函数实现调用函数实现功能
int main()
{
LinkList mylist;
Init_List(&mylist);
for (int i = 0; i < 10; ++i)
{
push_front(&mylist, i + 10);
}
Print_List(&mylist);
return 0;
}