顺序表
定义结构体
struct SequentialList{
eleType *elements;
int size;//顺序表元素个数
int capacity;//实际容量
};
初始化顺序表
void initialilzeList(SequentialList *list,int capacity){
//初始化数组
//->取指针类型的成员变量
list->elements = new eleType[capacity];//申请空间
list->size = 0;
list->capacity = capacity;
}
销毁顺序表
void destroyList(SequentialList *list){
//销毁顺序表
delete [] list->elements;//delete关键则直接删除
}
获取顺序表大小
int size(SequentialList *list){
//获取顺序表大小
return list->size;
}
判断顺序表是否为空
bool isEmpty(SequentialList *list){
//判断顺序表是否为空
return list->size == 0;
}
顺序表插入元素
void insert(SequentialList *list,int index,eleType element){
//顺序表的插入,index表示插入位置,element表示要插入的数据
//判断index是否合法
if(index < 0 || index > list->size){
throw std::invalid_argument("Invalid index");
}
if(list->size == list->capacity){
//顺序表用完不能插入,需要扩容
int newCapacity = list->capacity * 2;
eleType *newElements = new eleType[newCapacity];
for(int i = 0;i < list->size;++i){
newElements[i]= list->elements[i];
}
delete[] list->elements;
list->elements = newElements;
list->capacity = newCapacity;
}
for(int i = list->size;i>index;--i){
//顺序表index后的所有元素往后移动一个元素单位
list->elements[i] = list->elements[i-1];
}
list->elements[index] = element;
list->size++;
}
顺序表删除元素
void deleteElements(SequentialList *list,int index){
//顺序表删除元素 index表示要删除元素的位置
//判断index是否合法
if(index < 0 || index >= list->size){
throw std::invalid_argument("Invalid index");
}
for(int i = index;i < list->size-1;++i){
//顺序表index后的所有元素往前移动一个元素单位
list->elements[i] = list->elements[i+1];
}
list->size--;
}
顺序表查找元素下标
int findElement(SequentialList *list,eleType element){
//查找元素下标;
for (int i = 0; i < list->size; i++) {
if(list->elements[i] == element){
return i;
}
}
return -1;
}
顺序表获取第index个元素
int getElement(SequentialList *list,int index){
//获取第index个元素
//判断index是否合法
if(index < 0 || index >= list->size){
throw std::invalid_argument("Invalid index");
}
return list->elements[index];
}
顺序表修改元素
void updateElement(SequentialList *list,int index,eleType elements){
//修改元素
//判断index是否合法
if(index < 0 || index >= list->size){
throw std::invalid_argument("Invalid index");
}
list->elements[index] = elements;
}
测试
int main(){
SequentialList mylist;
initialilzeList(&mylist,10);
for (int i = 0; i < 10; i++) {
insert(&mylist,i,i*10);
}
cout << "size:" << size(&mylist) <<endl;
cout << "isEmpty:" << isEmpty(&mylist) <<endl;
for (int i = 0; i < size(&mylist); i++) {
cout << getElement(&mylist,i) << " ";
}
cout<<endl;
deleteElements(&mylist,5);
updateElement(&mylist,1,1314);
for (int i = 0; i < size(&mylist); i++) {
cout << getElement(&mylist,i) << " ";
}
cout<<endl;
int idx = findElement(&mylist,20);
updateElement(&mylist,idx,520);
for (int i = 0; i < size(&mylist); i++) {
cout << getElement(&mylist,i) << " ";
}
cout<<endl;
destroyList(&mylist);
return 0;
}
全部总结代码
#include<bits/stdc++.h>
using namespace std;
#define eleType int
struct SequentialList{
eleType *elements;
int size;//顺序表元素个数
int capacity;//实际容量
};
void initialilzeList(SequentialList *list,int capacity){
//初始化数组
//->取指针类型的成员变量
list->elements = new eleType[capacity];//申请空间
list->size = 0;
list->capacity = capacity;
}
void destroyList(SequentialList *list){
//销毁顺序表
delete [] list->elements;//delete关键则直接删除
}
int size(SequentialList *list){
//获取顺序表大小
return list->size;
}
bool isEmpty(SequentialList *list){
//判断顺序表是否为空
return list->size == 0;
}
void insert(SequentialList *list,int index,eleType element){
//顺序表的插入,index表示插入位置,element表示要插入的数据
//判断index是否合法
if(index < 0 || index > list->size){
throw std::invalid_argument("Invalid index");
}
if(list->size == list->capacity){
//顺序表用完不能插入,需要扩容
int newCapacity = list->capacity * 2;
eleType *newElements = new eleType[newCapacity];
for(int i = 0;i < list->size;++i){
newElements[i]= list->elements[i];
}
delete[] list->elements;
list->elements = newElements;
list->capacity = newCapacity;
}
for(int i = list->size;i>index;--i){
//顺序表index后的所有元素往后移动一个元素单位
list->elements[i] = list->elements[i-1];
}
list->elements[index] = element;
list->size++;
}
void deleteElements(SequentialList *list,int index){
//顺序表删除元素 index表示要删除元素的位置
//判断index是否合法
if(index < 0 || index >= list->size){
throw std::invalid_argument("Invalid index");
}
for(int i = index;i < list->size-1;++i){
//顺序表index后的所有元素往前移动一个元素单位
list->elements[i] = list->elements[i+1];
}
list->size--;
}
int findElement(SequentialList *list,eleType element){
//查找元素下标;
for (int i = 0; i < list->size; i++) {
if(list->elements[i] == element){
return i;
}
}
return -1;
}
int getElement(SequentialList *list,int index){
//获取第index个元素
//判断index是否合法
if(index < 0 || index >= list->size){
throw std::invalid_argument("Invalid index");
}
return list->elements[index];
}
void updateElement(SequentialList *list,int index,eleType elements){
//修改元素
//判断index是否合法
if(index < 0 || index >= list->size){
throw std::invalid_argument("Invalid index");
}
list->elements[index] = elements;
}
int main(){
SequentialList mylist;
initialilzeList(&mylist,10);
for (int i = 0; i < 10; i++) {
insert(&mylist,i,i*10);
}
cout << "size:" << size(&mylist) <<endl;
cout << "isEmpty:" << isEmpty(&mylist) <<endl;
for (int i = 0; i < size(&mylist); i++) {
cout << getElement(&mylist,i) << " ";
}
cout<<endl;
deleteElements(&mylist,5);
updateElement(&mylist,1,1314);
for (int i = 0; i < size(&mylist); i++) {
cout << getElement(&mylist,i) << " ";
}
cout<<endl;
int idx = findElement(&mylist,20);
updateElement(&mylist,idx,520);
for (int i = 0; i < size(&mylist); i++) {
cout << getElement(&mylist,i) << " ";
}
cout<<endl;
destroyList(&mylist);
return 0;
}
c++自带顺序表
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> ret = {1,2,3,4,5};
for (int i = 0; i < ret.size(); i++) {
cout << ret[i] << " ";
}
cout<<endl;
ret.push_back(1024);
cout<<ret.size() <<endl;
for (int i = 0; i < ret.size(); i++) {
cout << ret[i] << " ";
}
cout<<endl;
}