世 上 没 有 绝 望 的 处 境
只 有 对 处 境 绝 望 的 人
顺序表
这里已经写好的现成的线性表,可以直接参考。相信C语言过关加上一点点了解C++的伙伴应该不会有问题。如果有问题的话请在下方评论区留言。
首先用malloc开辟,用realloc扩展,这就是顺序表存储的核心机制。
其余的和数组一样,指针调用
merge展示
#include<iostream>
#include<stdlib.h>
#define Init_size 10
#define Increment 10
using namespace std;
struct SqList {
int* base;
int now_size;
int list_size;
};
void init(SqList& L)//初始化顺序表,包括内存开辟,长度和线性表大小的设定
{
L.base = (int*)malloc(Init_size * sizeof(int));
if (!L.base)
{
cout << "在初始化时,内存开辟失败" << endl;
return;
}
L.now_size = 0;
L.list_size = Init_size;
return;
}
bool Empty(SqList L)//检测当前顺序表是否为空
{
if (L.now_size)
return false;
return true;
}
int size(SqList L)//寻求当前顺序表已使用的大小
{
return L.now_size;
}
int Get_elem(SqList L, int position)//获取元素,从0开始
{
if (position < 0 || position >= L.now_size)
{
cout << "内容查询出错,返回错误-1" << endl;
return -1;
}
return L.base[position];
}
int Get_locate(SqList L, int aim)//查询顺序表内的某个值的位置
{
for (int i = 0; i < L.now_size; i++)
if (L.base[i] == aim)
return i;
cout << "为查询到所目标所在位置,返回错误值-1" << endl;
return -1;
}
void delet(SqList& L, int position)//删除 position 的元素
{
for (int i = position; i < L.now_size; i++)
L.base[i] = L.base[i + 1];
L.now_size--;
}
void insert(SqList& L, int position, int val)//在postion 位置 插入val
{
if (position < 0 || position > L.now_size)
{
cout << "插入位置非法" << endl;
return;
}
if (L.now_size == L.list_size)
{
int* newbase = (int*)realloc(L.base, (L.list_size + Increment) * sizeof(int));
if (!newbase)
{
cout << "动态内存开辟失败" << endl;
return;
}
L.list_size += Increment;
L.base = newbase;
}
for (int i = L.now_size; i >= position; i--)
L.base[i] = L.base[i - 1];
L.base[position] = val;
L.now_size++;
return;
}
SqList merge(SqList A, SqList B)//合并顺序表
{
SqList temp;
init(temp);
int now_a = 0, now_b = 0;
while (now_a != A.now_size || now_b != B.now_size)
{
if (now_a == A.now_size)
insert(temp, temp.now_size, B.base[now_b++]);
else if (now_b == B.now_size)
insert(temp, temp.now_size, A.base[now_a++]);
else
{
if (A.base[now_a] < B.base[now_b])
insert(temp, temp.now_size, A.base[now_a++]);
else
insert(temp, temp.now_size, B.base[now_b++]);
}
}
return temp;
}
int main()
{
cin.tie(NULL);
cout.tie(NULL);
ios::sync_with_stdio(false);
int temp, now_a, now_b;
SqList A, B, ans;
init(A);
init(B);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
cin >> temp;
insert(A, i, temp);
}
for (int i = 0; i < m; i++)
{
cin >> temp;
insert(B, i, temp);
}
ans = merge(A, B);
for (int i = 0; i < ans.now_size; i++)
cout << Get_elem(ans, i) << " ";
cout << endl;
}
基本功能展示
#include<iostream>
#include<stdlib.h>
#define Init_size 10
#define Increment 10
using namespace std;
struct SqList {
int* base;
int now_size;
int list_size;
};
void init(SqList& L)//初始化顺序表,包括内存开辟,长度和线性表大小的设定
{
L.base = (int*)malloc(Init_size * sizeof(int));
if (!L.base)
{
cout << "在初始化时,内存开辟失败" << endl;
return;
}
L.now_size = 0;
L.list_size = Init_size;
return;
}
bool Empty(SqList L)//检测当前顺序表是否为空
{
if (L.now_size)
return false;
return true;
}
int size(SqList L)//寻求当前顺序表已使用的大小
{
return L.now_size;
}
int Get_elem(SqList L, int position)//获取元素,从0开始
{
if (position < 0 || position >= L.now_size)
{
cout << "内容查询出错,返回错误-1" << endl;
return -1;
}
return L.base[position];
}
int Get_locate(SqList L, int aim)//查询顺序表内的某个值的位置
{
for (int i = 0; i < L.now_size; i++)
if (L.base[i] == aim)
return i;
cout << "为查询到所目标所在位置,返回错误值-1" << endl;
return -1;
}
void delet(SqList& L, int position)//删除 position 的元素
{
for (int i = position; i < L.now_size; i++)
L.base[i] = L.base[i + 1];
L.now_size--;
}
void insert(SqList& L, int position, int val)//在postion 位置 插入val
{
if (position < 0 || position > L.now_size)
{
cout << "插入位置非法" << endl;
return;
}
if (L.now_size == L.list_size)
{
int* newbase = (int*)realloc(L.base, (L.list_size + Increment) * sizeof(int));
if (!newbase)
{
cout << "动态内存开辟失败" << endl;
return;
}
L.list_size += Increment;
L.base = newbase;
}
for (int i = L.now_size; i >= position; i--)
L.base[i] = L.base[i - 1];
L.base[position] = val;
L.now_size++;
return;
}
SqList merge(SqList A, SqList B)//合并顺序表
{
SqList temp;
init(temp);
int now_a = 0, now_b = 0;
while (now_a != A.now_size || now_b != B.now_size)
{
if (now_a == A.now_size)
insert(temp, temp.now_size, B.base[now_b++]);
else if (now_b == B.now_size)
insert(temp, temp.now_size, A.base[now_a++]);
else
{
if (A.base[now_a] < B.base[now_b])
insert(temp, temp.now_size, A.base[now_a++]);
else
insert(temp, temp.now_size, B.base[now_b++]);
}
}
return temp;
}
int main()
{
cin.tie(NULL);
cout.tie(NULL);
ios::sync_with_stdio(false);
int n, temp, val;
SqList save;
init(save);
if (Empty(save))
cout << "该顺序表已清空" << endl;
else
{
cout << "该顺序表清空失败" << endl;
return 0;
}
cout << "请输入您要存储的个数" << endl;
cin >> n;
for (int i = 0; i < n; i++)
cin >> save.base[save.now_size++];
cout << "现在有" << size(save) << "个数据已储存" << endl;
for (int i = 0; i < save.now_size; i++)
cout << Get_elem(save, i) << " " << endl;
cout << "请输入您要查询的数字" << endl;
cin >> temp;
cout << Get_locate(save, temp) << endl;
cout << "请输入要插入在哪个及其大小" << endl;
cin >> temp >> val;
insert(save, temp, val);
for (int i = 0; i < save.now_size; i++)
cout << Get_elem(save, i) << " " << endl;
cout << "请输入你想删除第号元素" << endl;
cin >> temp;
delet(save, temp);
for (int i = 0; i < save.now_size; i++)
cout << Get_elem(save, i) << " " << endl;
return 0;
}
By-轮月