93c16edb5a
- 修正主README.md中的所有路径引用,使其与当前文件结构一致 - 更新翁凯C语言学习指南链接路径 - 更新五子棋AI项目文档链接路径 - 更新数据结构学习文档链接路径 - 修正编译说明和学习模块使用指南中的目录路径 - 改进五子棋README.md的编译运行说明,增加Windows和Linux/macOS的分平台指导 - 确保所有文档链接和路径引用都能正确工作
129 lines
2.3 KiB
C
129 lines
2.3 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
#include <math.h>
|
|
#include <stdbool.h>
|
|
#include <string.h>
|
|
#ifdef _WIN32
|
|
#include <windows.h>
|
|
#include <direct.h>
|
|
#endif
|
|
|
|
/**
|
|
* 链表操作示例程序
|
|
*
|
|
* 本程序演示了单向链表的基本操作:
|
|
* 1. 创建链表并添加节点
|
|
* 2. 遍历并打印链表
|
|
* 3. 在链表中查找特定值
|
|
* 4. 从链表中删除特定值的节点
|
|
*/
|
|
|
|
typedef struct _node
|
|
{
|
|
int value;
|
|
struct _node *next;
|
|
} Node;
|
|
|
|
typedef struct _list
|
|
{
|
|
Node *head;
|
|
Node *tail;
|
|
} List;
|
|
|
|
void add(List *pList, int value)
|
|
{
|
|
Node *p = (Node *)malloc(sizeof(Node));
|
|
p->value = value;
|
|
p->next = NULL;
|
|
// 将节点插入链表
|
|
Node *last = pList->head;
|
|
if (last != NULL)
|
|
{
|
|
while (last->next != NULL)
|
|
{
|
|
last = last->next;
|
|
}
|
|
// attach
|
|
last->next = p;
|
|
}
|
|
else
|
|
{
|
|
pList->head = p;
|
|
}
|
|
}
|
|
|
|
void print(List *pList)
|
|
{
|
|
Node *p;
|
|
for (p = pList->head; p; p = p->next)
|
|
{
|
|
printf("%d\t", p->value);
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
int main()
|
|
{
|
|
// 设置控制台编码为UTF-8
|
|
#ifdef _WIN32
|
|
system("chcp 65001 > nul"); // 设置控制台编码为UTF-8
|
|
SetConsoleOutputCP(65001); // 设置控制台输出编码
|
|
SetConsoleCP(65001); // 设置控制台输入编码
|
|
#endif
|
|
|
|
List list;
|
|
list.head = NULL;
|
|
list.tail = NULL;
|
|
int number;
|
|
do
|
|
{
|
|
printf("请输入一个整数:");
|
|
scanf("%d", &number);
|
|
if (number != -1)
|
|
{
|
|
|
|
add(&list, number);
|
|
}
|
|
} while (number != -1);
|
|
print(&list);
|
|
|
|
scanf("%d", &number);
|
|
Node *p;
|
|
int isFound = 0;
|
|
for (p = list.head; p; p = p->next)
|
|
{
|
|
if (p->value == number)
|
|
{
|
|
printf("找到!\n");
|
|
isFound = 1;
|
|
break;
|
|
}
|
|
}
|
|
if (!isFound)
|
|
{
|
|
printf("未找到!\n");
|
|
}
|
|
|
|
Node *q;
|
|
for (q = NULL, p = list.head; p; q = p, p = p->next)
|
|
{
|
|
if (p->value == number)
|
|
{
|
|
if (q == NULL)
|
|
{
|
|
list.head = p->next;
|
|
}
|
|
else
|
|
{
|
|
q->next = p->next;
|
|
}
|
|
free(p);
|
|
printf("删除成功!\n");
|
|
|
|
break;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
} |