mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 23:16:28 +08:00
1c8b7ef559
* Replace 结点 with 节点 Update the footnotes in the figures * Update mindmap * Reduce the size of the mindmap.png
69 lines
No EOL
1.4 KiB
C++
69 lines
No EOL
1.4 KiB
C++
/**
|
|
* File: list_node.h
|
|
* Created Time: 2023-01-09
|
|
* Author: Reanon (793584285@qq.com)
|
|
*/
|
|
#ifndef LIST_NODE_H
|
|
#define LIST_NODE_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/* 链表节点结构体 */
|
|
struct ListNode {
|
|
int val; // 节点值
|
|
struct ListNode *next; // 指向下一节点的指针（引用）
|
|
};
|
|
|
|
// typedef 作用是为一种数据类型定义一个新名字
|
|
typedef struct ListNode ListNode;
|
|
|
|
/* 构造函数，初始化一个新节点 */
|
|
ListNode *newListNode(int val) {
|
|
ListNode *node, *next;
|
|
node = (ListNode *) malloc(sizeof(ListNode));
|
|
node->val = val;
|
|
node->next = NULL;
|
|
return node;
|
|
}
|
|
|
|
/**
|
|
* @brief Generate a linked list with a vector
|
|
*
|
|
* @param list
|
|
* @return ListNode*
|
|
*/
|
|
ListNode *arrToLinkedList(const int *arr, size_t size) {
|
|
if (size <= 0) {
|
|
return NULL;
|
|
}
|
|
|
|
ListNode *dummy = newListNode(0);
|
|
ListNode *node = dummy;
|
|
for (int i = 0; i < size; i++) {
|
|
node->next = newListNode(arr[i]);
|
|
node = node->next;
|
|
}
|
|
return dummy->next;
|
|
}
|
|
|
|
/**
|
|
* @brief Get a list node with specific value from a linked list
|
|
*
|
|
* @param head
|
|
* @param val
|
|
* @return ListNode*
|
|
*/
|
|
ListNode *getListNode(ListNode *head, int val) {
|
|
while (head != NULL && head->val != val) {
|
|
head = head->next;
|
|
}
|
|
return head;
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif // LIST_NODE_H
|