2025-03-17 14:00:57 +08:00
|
|
|
|
#ifndef SQ_LIST_H
|
|
|
|
|
#define SQ_LIST_H
|
|
|
|
|
#define MAX 100
|
|
|
|
|
|
2025-03-20 18:07:55 +08:00
|
|
|
|
|
2025-03-17 14:00:57 +08:00
|
|
|
|
typedef struct sq_list
|
|
|
|
|
{
|
|
|
|
|
int data[MAX];
|
|
|
|
|
int length;
|
|
|
|
|
} sq_list;
|
|
|
|
|
|
|
|
|
|
// <20><>ʼ<EFBFBD><CABC>
|
2025-03-18 15:43:19 +08:00
|
|
|
|
sq_list *init_sq_list(void);
|
2025-03-17 14:00:57 +08:00
|
|
|
|
|
|
|
|
|
// ɾ<><C9BE>
|
2025-03-17 14:24:44 +08:00
|
|
|
|
void delete_sq_list(sq_list* list, int pos);
|
2025-03-17 14:00:57 +08:00
|
|
|
|
|
|
|
|
|
// <20>滻
|
|
|
|
|
void replace_sq_list(sq_list* list, int pos, int value);
|
|
|
|
|
|
|
|
|
|
// <20><><EFBFBD><EFBFBD>
|
|
|
|
|
void insert_sq_list(sq_list* list, int pos, int value);
|
|
|
|
|
|
|
|
|
|
// <20><>ӡ
|
|
|
|
|
void print_sq_list(sq_list* list);
|
|
|
|
|
|
2025-03-20 22:44:30 +08:00
|
|
|
|
//<2F><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
|
|
|
|
|
void get_sq_list(sq_list* list1,int pos, int *e);
|
|
|
|
|
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD>
|
|
|
|
|
int locate_list(sq_list* list, int e);
|
|
|
|
|
|
|
|
|
|
// <20>ϲ<EFBFBD>˳<EFBFBD><CBB3><EFBFBD><EFBFBD>1.0
|
2025-03-20 18:07:55 +08:00
|
|
|
|
void merge_sq_list(sq_list* list_1, sq_list* list_2);
|
|
|
|
|
|
2025-03-20 22:44:30 +08:00
|
|
|
|
//<2F>ϲ<EFBFBD>˳<EFBFBD><CBB3><EFBFBD><EFBFBD>2.0
|
|
|
|
|
void mer_ge_sq_list(sq_list* list_1, sq_list* list_2);
|
2025-03-17 14:00:57 +08:00
|
|
|
|
#endif
|
|
|
|
|
|