120 lines
2.7 KiB
C
120 lines
2.7 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "sq_list.h"
|
|
|
|
sq_list* init_sq_list(void)
|
|
{
|
|
sq_list* name = (sq_list*)malloc(sizeof(sq_list));
|
|
memset(name, 0, sizeof(sq_list));
|
|
return name;
|
|
}
|
|
|
|
// 删除
|
|
void delete_sq_list(sq_list* list,int pos)
|
|
{
|
|
if (pos < 0 || pos > list->length || list->length == MAX)
|
|
{
|
|
printf("位置错误\n");
|
|
return;
|
|
}
|
|
if (pos == list->length - 1)
|
|
list->data[pos] = 0;
|
|
else
|
|
{
|
|
for (int i = pos; i < list->length - 1; i++)
|
|
list->data[i] = list->data[i + 1];
|
|
list->data[list->length - 1] = 0;
|
|
}
|
|
list->length--;
|
|
}
|
|
|
|
// 替换
|
|
void replace_sq_list(sq_list* list, int pos, int value)
|
|
{
|
|
if (pos < 0 || pos > list->length || list->length >= MAX)
|
|
{
|
|
printf("位置错误\n");
|
|
return;
|
|
}
|
|
if (pos > list->length && pos <= MAX)
|
|
printf("不建议在此处插入");
|
|
list->data[pos] = value;
|
|
}
|
|
|
|
|
|
// 插入
|
|
void insert_sq_list(sq_list* list, int pos, int value)
|
|
{
|
|
if (pos < 0 || pos > list->length || list->length >= MAX)
|
|
{
|
|
printf("位置错误\n");
|
|
return;
|
|
}
|
|
if (pos == MAX)
|
|
printf("有损插入\n");
|
|
if (pos > list->length && pos <= MAX)
|
|
printf("不建议在此处插入");
|
|
int i = list->length -1;
|
|
int flog = i;
|
|
for (i; i >= pos-1; i--)
|
|
{
|
|
list->data[i + 1] = list->data[i];
|
|
}
|
|
list->data[pos] = value;
|
|
if (flog + 1 > list->length)
|
|
list->length++;
|
|
}
|
|
|
|
|
|
|
|
|
|
// 打印
|
|
void print_sq_list(sq_list* list)
|
|
{
|
|
printf("[");
|
|
for (int i = 0; i < list->length; i++)
|
|
printf("%d ", list->data[i]);
|
|
printf("]");
|
|
printf("\n");
|
|
}
|
|
|
|
// 2 到 1
|
|
void merge_sq_list(sq_list* list_1, sq_list* list_2)
|
|
{
|
|
if (list_1->length == 0 || list_2->length == 0)
|
|
{
|
|
printf("有一个空表\n");
|
|
return;
|
|
}
|
|
if ((list_1->length + list_2->length) > MAX)
|
|
printf("总和超范围\n但是会继续合并只不过可能为有损合并\n");
|
|
int flog = 0;
|
|
for (int i = 0; i < list_2->length; i++)
|
|
{
|
|
|
|
for (int j = 0; j < list_1->length; j++)
|
|
{
|
|
if (list_1->data[j] != list_2->data[i])
|
|
continue;
|
|
else if (list_1->data[j] == list_2->data[i])
|
|
{
|
|
flog++; break;
|
|
}
|
|
else
|
|
{
|
|
list_1->data[list_1->length] = list_2->data[i];
|
|
list_1->length++;
|
|
}
|
|
}
|
|
|
|
}
|
|
printf("----------------------------------\n");
|
|
printf("有%d相同 有%d不相同\n", flog, list_2->length - flog);
|
|
printf("----------------------------------\n");
|
|
}
|
|
|
|
//if (list_1->data[j] != list_2->data[i])
|
|
//continue;
|
|
//else if (list_1->data[j] == list_2->data[i])
|
|
//break;
|