algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-25 11:13:38 +08:00
Code Issues Packages Projects Releases Wiki Activity

Publish the C codes to the docs. (#469)

Browse Source
This commit is contained in:
Yudong Jin
2023-04-18 20:21:31 +08:00
committed by GitHub
parent 6723cdbc7e
commit dbc4906582
29 changed files with 288 additions and 189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
docs/chapter_array_and_linkedlist/linked_list.md
View File

@ -95,10 +95,9 @@
struct ListNode *next; // 指向下一节点的指针（引用）
};
// typedef 作用是为一种数据类型定义一个新名字
typedef struct ListNode ListNode;
/* 构造函数，初始化一个新节点 */
/* 构造函数 */
ListNode *newListNode(int val) {
ListNode *node, *next;
node = (ListNode *) malloc(sizeof(ListNode));
@ -379,7 +378,7 @@
=== "C"
```c title="linked_list.c"
[class]{}-[func]{insertNode}
[class]{}-[func]{insert}
```
=== "C#"
@ -573,7 +572,7 @@
=== "C"
```c title="linked_list.c"
[class]{}-[func]{findNode}
[class]{}-[func]{find}
```
=== "C#"
@ -692,7 +691,24 @@
=== "C"
```c title=""
/* 双向链表节点结构体 */
struct ListNode {
int val; // 节点值
struct ListNode *next; // 指向后继节点的指针（引用）
struct ListNode *prev; // 指向前驱节点的指针（引用）
};
typedef struct ListNode ListNode;
/* 构造函数 */
ListNode *newListNode(int val) {
ListNode *node, *next;
node = (ListNode *) malloc(sizeof(ListNode));
node->val = val;
node->next = NULL;
node->prev = NULL;
return node;
}
```
=== "C#"

12
docs/chapter_array_and_linkedlist/list.md
View File

@ -73,7 +73,7 @@
=== "C"
```c title="list.c"
// C 未提供内置动态数组
```
=== "C#"
@ -171,7 +171,7 @@
=== "C"
```c title="list.c"
// C 未提供内置动态数组
```
=== "C#"
@ -329,7 +329,7 @@
=== "C"
```c title="list.c"
// C 未提供内置动态数组
```
=== "C#"
@ -491,7 +491,7 @@
=== "C"
```c title="list.c"
// C 未提供内置动态数组
```
=== "C#"
@ -599,7 +599,7 @@
=== "C"
```c title="list.c"
// C 未提供内置动态数组
```
=== "C#"
@ -675,7 +675,7 @@
=== "C"
```c title="list.c"
// C 未提供内置动态数组
```
=== "C#"