|
| 1 | +#include "array_utils.h" |
| 2 | +#include <string.h> // 用于 memcpy 和 memcmp |
| 3 | +#include <stdlib.h> // 用于 malloc 和 free |
| 4 | + |
| 5 | +// 去重实现 |
| 6 | +size_t remove_duplicates(void *base, size_t num, size_t size, CompareFunc compare) |
| 7 | +{ |
| 8 | + if (num == 0) return 0; |
| 9 | + |
| 10 | + char *array = (char *)base; |
| 11 | + size_t unique_index = 0; |
| 12 | + |
| 13 | + for (size_t i = 1; i < num; i++) |
| 14 | + { |
| 15 | + if (compare(array + i * size, array + unique_index * size) != 0) |
| 16 | + { |
| 17 | + unique_index++; |
| 18 | + memcpy(array + unique_index * size, array + i * size, size); |
| 19 | + } |
| 20 | + } |
| 21 | + |
| 22 | + return unique_index + 1; // 返回去重后的元素个数 |
| 23 | +} |
| 24 | + |
| 25 | +// 反转数组实现 |
| 26 | +void reverse_array(void *base, size_t num, size_t size) |
| 27 | +{ |
| 28 | + char *array = (char *)base; |
| 29 | + for (size_t i = 0; i < num / 2; i++) |
| 30 | + { |
| 31 | + void *temp = malloc(size); |
| 32 | + memcpy(temp, array + i * size, size); |
| 33 | + memcpy(array + i * size, array + (num - i - 1) * size, size); |
| 34 | + memcpy(array + (num - i - 1) * size, temp, size); |
| 35 | + free(temp); |
| 36 | + } |
| 37 | +} |
| 38 | + |
| 39 | +// 查找中位数实现 |
| 40 | +void *find_median(void *base, size_t num, size_t size, CompareFunc compare) |
| 41 | +{ |
| 42 | + if (num == 0) return NULL; |
| 43 | + |
| 44 | + quickSort(base, num, size, compare); // 先排序 |
| 45 | + return (char *)base + (num / 2) * size; |
| 46 | +} |
| 47 | + |
| 48 | +// 查找众数实现 |
| 49 | +void *find_mode(void *base, size_t num, size_t size, CompareFunc compare) |
| 50 | +{ |
| 51 | + if (num == 0) return NULL; |
| 52 | + |
| 53 | + quickSort(base, num, size, compare); // 先排序 |
| 54 | + |
| 55 | + char *array = (char *)base; |
| 56 | + void *mode = array; |
| 57 | + size_t max_count = 1; |
| 58 | + size_t current_count = 1; |
| 59 | + |
| 60 | + for (size_t i = 1; i < num; i++) |
| 61 | + { |
| 62 | + if (compare(array + i * size, array + (i - 1) * size) == 0) |
| 63 | + { |
| 64 | + current_count++; |
| 65 | + if (current_count > max_count) |
| 66 | + { |
| 67 | + max_count = current_count; |
| 68 | + mode = array + i * size; |
| 69 | + } |
| 70 | + } |
| 71 | + else { current_count = 1; } |
| 72 | + } |
| 73 | + |
| 74 | + return mode; |
| 75 | +} |
| 76 | + |
| 77 | +// 数组切片实现 |
| 78 | +void array_slice(void *dest, const void *src, size_t start, size_t end, size_t size) |
| 79 | +{ |
| 80 | + const char *source = (const char *)src; |
| 81 | + char *destination = (char *)dest; |
| 82 | + |
| 83 | + for (size_t i = start; i < end; i++) { memcpy(destination + (i - start) * size, source + i * size, size); } |
| 84 | +} |
| 85 | + |
| 86 | +// 数组填充实现 |
| 87 | +void array_fill(void *base, size_t num, size_t size, const void *value) |
| 88 | +{ |
| 89 | + char *array = (char *)base; |
| 90 | + for (size_t i = 0; i < num; i++) { memcpy(array + i * size, value, size); } |
| 91 | +} |
| 92 | + |
| 93 | +// 数组拷贝实现 |
| 94 | +void array_copy(void *dest, const void *src, size_t num, size_t size) |
| 95 | +{ |
| 96 | + memcpy(dest, src, num * size); |
| 97 | +} |
| 98 | + |
| 99 | +// 数组求和实现（适用于数值类型） |
| 100 | +double array_sum(const void *base, size_t num, size_t size) |
| 101 | +{ |
| 102 | + const char *array = (const char *)base; |
| 103 | + double sum = 0.0; |
| 104 | + |
| 105 | + for (size_t i = 0; i < num; i++) |
| 106 | + { |
| 107 | + if (size == sizeof(int)) { sum += *(int *)(array + i * size); } |
| 108 | + else if (size == sizeof(double)) { sum += *(double *)(array + i * size); } |
| 109 | + // 可以扩展支持更多类型 |
| 110 | + } |
| 111 | + |
| 112 | + return sum; |
| 113 | +} |
| 114 | + |
| 115 | +// 数组平均值实现（适用于数值类型） |
| 116 | +double array_average(const void *base, size_t num, size_t size) |
| 117 | +{ |
| 118 | + if (num == 0) return 0.0; |
| 119 | + return array_sum(base, num, size) / num; |
| 120 | +} |
0 commit comments