順序表實現數組的功能
#include <bits/stdc++.h> using namespace std; typedef struct { int *elem, len; }Array; const int maxn = 1e5; int j,choose,n,e,gn,fn,ip,in,choose2,Insert,dn; Array a; // typedef int Status int InitList(Array &L) { L.elem = new int[maxn]; if (!L.elem) return -2; L.len = 0; return 1; } int GetElem(Array L, int i, int &e) { if ((i < 1) || (i > L.len)) return 0; e = L.elem[i - 1]; return 1; } int LocateElem(Array L, int e) { for (int i = 0; i < L.len; i++) if (L.elem[i] == e) return i + 1; return 0; } int ListInsert(Array &L, int i, int e) { if ((i < 1) || (i > L.len + 1)) return -2; if (L.len == maxn) return 0; for (j = L.len - 1; j >= i - 1; j--) { L.elem[j + 1] = L.elem[j]; } L.elem[i - 1] = e; L.len++; return 1; } int ListDelete(Array &L, int i) { if ((i < 1) || (i > L.len + 1)) return 0; for (j = i; j <= L.len - 1; j++) L.elem[j - 1] = L.elem[j]; L.len--; return 1; } int main() { // Array a; // InitList(a); // for (int xx = 1; xx <= 10; xx++) // cin >> a.elem[xx], a.len++; // cout << LocateElem(a, 5); cout<<"--------若要正常使用本功能，請在最開始的時候選擇初始化--------nnn"; cout << "1.初始化n"; cout << "2.取值n"; cout << "3.查找n"; cout << "4.插入n"; cout << "5.刪除n";cout << "0.退出n"; choose=-1; while(choose!=0) { cout<<"請選擇："; cin>>choose; switch(choose) { case 1: if(InitList(a)==1) { puts("初始化成功"); cout<<"請輸入你要輸入的數據個數：";cin>>n; cout<<"請輸入"<<n<<"個數：n"; for(j=0;j<n;j++) cin>>a.elem[j],a.len++; cout<<"存儲成功n"; } else puts("存儲分配失敗"); break; case 2: cout<<"請輸入你想取出來的數的位置：";cin>>gn; if(GetElem(a,gn,e)) cout<<"取出來的數為："<<e<<endl; else cout<<"位置不存在n"; break; case 3: cout<<"請輸入你想查找的數值：";cin>>fn; if(LocateElem(a,fn)) cout<<"查找成功n這個數是數列中的第"<<LocateElem(a,fn)<<"個元素n"; else cout<<"查找失敗，這個數不存在n"; break; case 4: cout<<"請輸入你想插入的元素：";cin>>in; cout<<"請輸入你想插入到的位置：";cin>>ip; Insert=ListInsert(a,ip,in); if(Insert==0) cout<<"插入失敗，存儲空間已滿n"; if(Insert==-2) cout<<"插入失敗，插入位置不存在n"; if(Insert==1) { cout<<"插入成功n"; choose2=-1; cout<<"是否要查看插入之後的數組？1=是，0=否：";cin>>choose2; if(choose=1) for(int i=0;i<a.len;i++) cout<<a.elem[i]<<" "; cout<<endl; } break; case 5: cout<<"請輸入你想刪除的數的位置：";cin>>dn; if(ListDelete(a,dn)) cout<<"刪除成功n"; else cout<<"刪除失敗n"; break; } } return 0; }
