网站建设方案包括,阳泉做网站,应用软件有哪些,无锡专业做网站的公司哪家好该楼层疑似违规已被系统折叠 隐藏此楼查看此楼/*--------用线性表存储字符串#xff0c;结合堆栈判断回文(关键判断个数为奇或偶#xff0c;奇跳过中间数据)---------*/#include #include #define ok 1;#define error 0;typedef char elemtype;typedef struct lnode{lnode *n…该楼层疑似违规已被系统折叠 隐藏此楼查看此楼/*--------用线性表存储字符串结合堆栈判断回文(关键判断个数为奇或偶奇跳过中间数据)---------*/#include #include #define ok 1;#define error 0;typedef char elemtype;typedef struct lnode{lnode *next;elemtype data;} lnode,*linklist;bool createlist(linklist h,int n){//尾差插法linklist p,q;hnew lnode;h-nextNULL;qh;coutif(n0) return error;for(int i0;ipnew lnode;cinp-data;p-nextq-next;q-nextp;qq-next;}return ok;}bool printlist(linklist h){linklist p;ph-next;while(p!NULL){coutdatapp-next;}return ok;}#define initsize 100#define stackincrs 10typedef struct{elemtype *base;elemtype *top;int stacksize;} stack;bool initstack(stack s){s.basenew elemtype [initsize];s.tops.base;s.stacksizeinitsize;return ok;}bool push(stack s,elemtype e){if(s.top-s.bases.stacksize){s.base(elemtype*)realloc(s.base,(s.stacksizestackincrs)*sizeof(elemtype));s.tops.bases.stacksize;s.stacksizes.stacksizestackincrs;}*s.tope;return ok;}bool pop(stack s,elemtype e){if(s.tops.base) return error;--s.top;e*s.top;return ok;}/************************回文判别***********/bool jude(stack s,linklist h,int n){//结果flag1为回文flag0不为回文linklist ph-next;for(int i1;in/2;i){push(s,p-data);pp-next;}if(n%2) pp-next;bool flag1;elemtype c;while(p!NULLflag){pop(s,c);if(cp-data)pp-next;else flag0;}return flag;}void main(){int n;stack s;linklist h;initstack(s);coutcinn;createlist(h,n);if (jude(s,h,n))coutelsecoutcout}
