软件技术基础一些实例.docVIP

软件技术基础上机实验习题 一、顺序表 基础编程： （1）编程实现线性表插入、删除 #includeiostream.h templateclass T class sq_LList { private: int mm; int nn; T *v; public: sq_LList(){ mm=0;nn=0;return;} sq_LList(int m) {mm=m; v=new T[mm]; nn=0; return; } void prt_sq_LList() {int i; coutnn=nnendl; for(i=0;inn;i++) coutv[i]endl; return; } int flag_sq_LList() { if(nn==mm)return(-1); if(nn==0) return (0); return(1); } void ins_sq_LList(int i,T b) {int k; if(nn==mm) coutoverflowendl; if(inn) i=nn+1; if(i1) i=1; for(k==nn;k=i;k--) v[k]=v[k-1]; v[i-1]=b; nn=nn+1; return; } void del_sq_LList(int i) {int k; if(nn==0) {coutunderflowendl; return; } if((i1)||(inn)) {coutNot this element in the list!endl; return; } for(k=i;knn;k++) v[k-1]=v[k]; nn=nn-1; return; } }; int main() {sq_LListdouble s1(100); cout第一个输出的顺序表对象s1:endl; s1.prt_sq_LList(); s1.ins_sq_LList(0,1.5); s1.ins_sq_LList(1,2.5); s1.ins_sq_LList(4,3.5); cout第二个输出的顺序表对象s1:endl; s1.prt_sq_LList(); s1.del_sq_LList(0); s1.del_sq_LList(2); cout第三个输出的顺序表对象s1:endl; s1.prt_sq_LList(); return 0; } 应用： （1）采用顺序表存储。 #includestdio.h typedef int maxix[100]; main() {maxix a; int count,d,i,m,n; do { printf(输入n和m:); scanf(%d,%d,n,m); } while(n=m); for(i=0;in;i++) a[i]=i+1; count=0;d=0; while(dn) for(i=0;in;i++) if(a[i]!=0) { count++; if(count==m) { printf(%d,a[i]); a[i]=0; count=0; d++; } } } （2）约瑟夫问题#include iostream.h struct monkey { int number; monkey *prev; monkey *next; }; void main() { int n,m; cout请输入猴子的数量endl; cinn; cout请输入非标记数endl; cinm; int i; monkey monkeys[1000]; monkey *p; for (i=0;in;i++) { monkeys[i].number = i+1; monkeys[i].prev = (i == 0) ? (monkeys[n-1]) : (monkeys[i-1]); monkeys[i].next = (i == n-1) ? monkeys : (monkeys[i+1]) ; } p = monkeys; do { for (i = 2; i = m; i++) { p = p-next; } coutmonkey No.p-numberis normalendl; p-prev-next = p-next; p-next-prev = p-prev; p =