sequence list 线性表_sequncelinerlist& list-优快云博客

本文链接：https://blog.youkuaiyun.com/zhouzhouhappy1988/article/details/77434681

本文介绍了一个简单的序列列表数据结构的实现方法，包括定义结构体、初始化、销毁、清空等基本操作，以及获取长度、元素定位、插入和删除等高级功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*seq_list.h:sequence list header.
 *Author    :ZMG.
 *E-mail    :
 *Date      :2017-8-20
 *Version   :0.1
 
 *ALL rights reserved!
 *Code style try to refer to GNU linux kernel. :)
 */
 
 
#ifndef SEQ_LIST_H
#define SEQ_LIST_H
 
 
//include some essential headers.
#include <stdio.h>
#include <stdlib.h>
 
//define sequence list structure type.
#define list_size  1000
#define data_type  int
 
typedef struct {
    data_type list[list_size];  //also: data_type * list,then define int list_size.
    int length;
}seq_list;
 
 
//functions declaration below
void init_seq_list(seq_list *L); //initialize sequence list.
void destroy_seq_list(seq_list *L); //destroy sequncent listist.
void clear_seq_list(seq_list *L); //empty sequence list.
void is_seq_list_empty(seq_list L); //sequence list is empty or not.
int get_seq_list_length(seq_list L); //sequence list's length.
int get_seq_list_element(seq_list L, int i, data_type *e); //get sequence list element.
int locate_seq_list_element(seq_list L, data_type e); //locate sequence list element.
int insert_seq_list_element(seq_list *L, int i, data_type e); //insert sequence list element.
int delete_seq_list_element(seq_list *L, int i, data_type *e); //delete sequence list element.
 
 
#endif // SEQ_LIST_H