algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
codes/cpp/chapter_array_and_linkedlist/linked_list.cpp
View File

@@ -6,14 +6,14 @@
#include "../include/include.hpp"
/* 在链表的结点 n0 之后插入结点 P */
/* 在链表的节点 n0 之后插入节点 P */
void insert(ListNode* n0, ListNode* P) {
ListNode* n1 = n0->next;
P->next = n1;
n0->next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */
/* 删除链表的节点 n0 之后的首个节点 */
void remove(ListNode* n0) {
if (n0->next == nullptr)
return;
@@ -25,7 +25,7 @@ void remove(ListNode* n0) {
delete P;
}
/* 访问链表中索引为 index 的结点 */
/* 访问链表中索引为 index 的节点 */
ListNode* access(ListNode* head, int index) {
for (int i = 0; i < index; i++) {
if (head == nullptr)
@@ -35,7 +35,7 @@ ListNode* access(ListNode* head, int index) {
return head;
}
/* 在链表中查找值为 target 的首个结点 */
/* 在链表中查找值为 target 的首个节点 */
int find(ListNode* head, int target) {
int index = 0;
while (head != nullptr) {
@@ -51,7 +51,7 @@ int find(ListNode* head, int target) {
/* Driver Code */
int main() {
/* 初始化链表 */
// 初始化各个结点
// 初始化各个节点
ListNode* n0 = new ListNode(1);
ListNode* n1 = new ListNode(3);
ListNode* n2 = new ListNode(2);
@@ -65,23 +65,23 @@ int main() {
cout << "初始化的链表为" << endl;
PrintUtil::printLinkedList(n0);
/* 插入结点 */
/* 插入节点 */
insert(n0, new ListNode(0));
cout << "插入结点后的链表为" << endl;
cout << "插入节点后的链表为" << endl;
PrintUtil::printLinkedList(n0);
/* 删除结点 */
/* 删除节点 */
remove(n0);
cout << "删除结点后的链表为" << endl;
cout << "删除节点后的链表为" << endl;
PrintUtil::printLinkedList(n0);
/* 访问结点 */
/* 访问节点 */
ListNode* node = access(n0, 3);
cout << "链表中索引 3 处的结点的值 = " << node->val << endl;
cout << "链表中索引 3 处的节点的值 = " << node->val << endl;
/* 查找结点 */
/* 查找节点 */
int index = find(n0, 2);
cout << "链表中值为 2 的结点的索引 = " << index << endl;
cout << "链表中值为 2 的节点的索引 = " << index << endl;
// 释放内存
freeMemoryLinkedList(n0);