线性表各个功能代码实现
时间: 2023-10-11 15:09:27 浏览: 46
线性表是一种数据结构,它由一组具有相同数据结构类型的元素组成,这些元素按照线性的顺序排列。下面是线性表的一些功能的代码实现:
1. 线性表的静态定义:
```cpp
#define MAXSIZE 100
typedef struct {
ElemType data[MAXSIZE];
int length;
} SqList;
```
2. 线性表的动态定义:
```cpp
#define INITSIZE 10
#define INCREMENT 5
typedef struct {
ElemType *data;
int length;
int size;
} SeqList;
void InitList(SeqList &L) {
L.data = (ElemType *)malloc(INITSIZE * sizeof(ElemType));
L.length = 0;
L.size = INITSIZE;
}
```
3. 线性表的静态初始化:
```cpp
void InitList(SqList &L) {
L.length = 0;
}
```
4. 线性表的动态初始化:
```cpp
void InitList(SeqList &L) {
L.data = (ElemType *)malloc(INITSIZE * sizeof(ElemType));
L.length = 0;
L.size = INITSIZE;
}
```
5. 线性表的插入:
```cpp
bool ListInsert(SeqList &L, int i, ElemType e) {
if (i < 1 || i > L.length + 1)
return false;
if (L.length >= L.size) {
L.data = (ElemType *)realloc(L.data, (L.size + INCREMENT) * sizeof(ElemType));
L.size += INCREMENT;
}
for (int j = L.length; j >= i; j--)
L.data[j] = L.data[j - 1];
L.data[i - 1] = e;
L.length++;
return true;
}
```
6. 线性表的删除:
```cpp
bool ListDelete(SeqList &L, int i, ElemType &e) {
if (i < 1 || i > L.length)
return false;
e = L.data[i - 1];
for (int j = i; j < L.length; j++)
L.data[j - 1] = L.data[j];
L.length--;
return true;
}
```
7. 线性表的按位查找:
```cpp
bool GetElem(SeqList L, int i, ElemType &e) {
if (i < 1 || i > L.length)
return false;
e = L.data[i - 1];
return true;
}
```
8. 线性表的按值查找:
```cpp
int LocateElem(SeqList L, ElemType e) {
for (int i = 0; i < L.length; i++) {
if (L.data[i] == e)
return i + 1;
}
return 0;
}
```
以上是线性表的一些基本功能的代码实现。