CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 02:10:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update variable names in list and my_list

Browse Source
This commit is contained in:
krahets
2023-10-09 18:20:42 +08:00
parent e5f8c93f5d
commit fb552987f5
25 changed files with 966 additions and 966 deletions
Download Patch File Download Diff File Expand all files Collapse all files

150
codes/c/chapter_array_and_linkedlist/my_list.c
View File

@@ -8,158 +8,158 @@
/* 列表类简易实现 */
struct myList {
int *nums; // 数组（存储列表元素）
int *arr; // 数组（存储列表元素）
int capacity; // 列表容量
int size; // 列表大小
int extendRatio; // 列表每次扩容的倍数
};
typedef struct myList myList;
typedef struct myList MyList;
void extendCapacity(myList *list);
void extendCapacity(MyList *nums);
/* 构造函数 */
myList *newMyList() {
myList *list = malloc(sizeof(myList));
list->capacity = 10;
list->nums = malloc(sizeof(int) * list->capacity);
list->size = 0;
list->extendRatio = 2;
return list;
MyList *newMyList() {
MyList *nums = malloc(sizeof(MyList));
nums->capacity = 10;
nums->arr = malloc(sizeof(int) * nums->capacity);
nums->size = 0;
nums->extendRatio = 2;
return nums;
}
/* 析构函数 */
void delMyList(myList *list) {
free(list->nums);
free(list);
void delMyList(MyList *nums) {
free(nums->arr);
free(nums);
}
/* 获取列表长度 */
int size(myList *list) {
return list->size;
int size(MyList *nums) {
return nums->size;
}
/* 获取列表容量 */
int capacity(myList *list) {
return list->capacity;
int capacity(MyList *nums) {
return nums->capacity;
}
/* 访问元素 */
int get(myList *list, int index) {
assert(index >= 0 && index < list->size);
return list->nums[index];
int get(MyList *nums, int index) {
assert(index >= 0 && index < nums->size);
return nums->arr[index];
}
/* 更新元素 */
void set(myList *list, int index, int num) {
assert(index >= 0 && index < list->size);
list->nums[index] = num;
void set(MyList *nums, int index, int num) {
assert(index >= 0 && index < nums->size);
nums->arr[index] = num;
}
/* 尾部添加元素 */
void add(myList *list, int num) {
if (size(list) == capacity(list)) {
extendCapacity(list); // 扩容
void add(MyList *nums, int num) {
if (size(nums) == capacity(nums)) {
extendCapacity(nums); // 扩容
}
list->nums[size(list)] = num;
list->size++;
nums->arr[size(nums)] = num;
nums->size++;
}
/* 中间插入元素 */
void insert(myList *list, int index, int num) {
assert(index >= 0 && index < size(list));
void insert(MyList *nums, int index, int num) {
assert(index >= 0 && index < size(nums));
// 元素数量超出容量时，触发扩容机制
if (size(list) == capacity(list)) {
extendCapacity(list); // 扩容
if (size(nums) == capacity(nums)) {
extendCapacity(nums); // 扩容
}
for (int i = size(list); i > index; --i) {
list->nums[i] = list->nums[i - 1];
for (int i = size(nums); i > index; --i) {
nums->arr[i] = nums->arr[i - 1];
}
list->nums[index] = num;
list->size++;
nums->arr[index] = num;
nums->size++;
}
/* 删除元素 */
// 注意：stdio.h 占用了 remove 关键词
int removeNum(myList *list, int index) {
assert(index >= 0 && index < size(list));
int num = list->nums[index];
for (int i = index; i < size(list) - 1; i++) {
list->nums[i] = list->nums[i + 1];
int removeNum(MyList *nums, int index) {
assert(index >= 0 && index < size(nums));
int num = nums->arr[index];
for (int i = index; i < size(nums) - 1; i++) {
nums->arr[i] = nums->arr[i + 1];
}
list->size--;
nums->size--;
return num;
}
/* 列表扩容 */
void extendCapacity(myList *list) {
void extendCapacity(MyList *nums) {
// 先分配空间
int newCapacity = capacity(list) * list->extendRatio;
int newCapacity = capacity(nums) * nums->extendRatio;
int *extend = (int *)malloc(sizeof(int) * newCapacity);
int *temp = list->nums;
int *temp = nums->arr;
// 拷贝旧数据到新数据
for (int i = 0; i < size(list); i++)
extend[i] = list->nums[i];
for (int i = 0; i < size(nums); i++)
extend[i] = nums->arr[i];
// 释放旧数据
free(temp);
// 更新新数据
list->nums = extend;
list->capacity = newCapacity;
nums->arr = extend;
nums->capacity = newCapacity;
}
/* 将列表转换为 Array 用于打印 */
int *toArray(myList *list) {
return list->nums;
int *toArray(MyList *nums) {
return nums->arr;
}
/* Driver Code */
int main() {
/* 初始化列表 */
myList *list = newMyList();
MyList *nums = newMyList();
/* 尾部添加元素 */
add(list, 1);
add(list, 3);
add(list, 2);
add(list, 5);
add(list, 4);
printf("列表 list = ");
printArray(toArray(list), size(list));
printf("容量 = %d ，长度 = %d\n", capacity(list), size(list));
add(nums, 1);
add(nums, 3);
add(nums, 2);
add(nums, 5);
add(nums, 4);
printf("列表 nums = ");
printArray(toArray(nums), size(nums));
printf("容量 = %d ，长度 = %d\n", capacity(nums), size(nums));
/* 中间插入元素 */
insert(list, 3, 6);
printf("在索引 3 处插入数字 6 ，得到 list = ");
printArray(toArray(list), size(list));
insert(nums, 3, 6);
printf("在索引 3 处插入数字 6 ，得到 nums = ");
printArray(toArray(nums), size(nums));
/* 删除元素 */
removeNum(list, 3);
printf("删除索引 3 处的元素，得到 list = ");
printArray(toArray(list), size(list));
removeNum(nums, 3);
printf("删除索引 3 处的元素，得到 nums = ");
printArray(toArray(nums), size(nums));
/* 访问元素 */
int num = get(list, 1);
int num = get(nums, 1);
printf("访问索引 1 处的元素，得到 num = %d\n", num);
/* 更新元素 */
set(list, 1, 0);
printf("将索引 1 处的元素更新为 0 ，得到 list = ");
printArray(toArray(list), size(list));
set(nums, 1, 0);
printf("将索引 1 处的元素更新为 0 ，得到 nums = ");
printArray(toArray(nums), size(nums));
/* 测试扩容机制 */
for (int i = 0; i < 10; i++) {
// 在 i = 5 时，列表长度将超出列表容量，此时触发扩容机制
add(list, i);
add(nums, i);
}
printf("扩容后的列表 list = ");
printArray(toArray(list), size(list));
printf("容量 = %d ，长度 = %d\n", capacity(list), size(list));
printf("扩容后的列表 nums = ");
printArray(toArray(nums), size(nums));
printf("容量 = %d ，长度 = %d\n", capacity(nums), size(nums));
/* 释放分配内存 */
delMyList(list);
delMyList(nums);
return 0;
}