1、判断回文

#include<stdio.h>
#include<stdlib.h>
typedef char DataType;//定义链栈
typedef struct snode
{DataType data;struct snode *next;
}LSnode,*LinkStack;//定义链队列
typedef struct QNode {
DataType data;
struct QNode *next;
}QNode,*Queueptr;typedef struct {
Queueptr front;
Queueptr rear;
}LinkQueue;//链栈的基本操作声明
LSnode * stackinitiate();
int stacknotempty(LSnode *H);
int stackpush(LSnode *H,DataType x);
int stackpop(LSnode *H,DataType *d);//链队列的基本操作声明
void InitQueue(LinkQueue *Q);
int Queuenotempty(LinkQueue *Q);
int EnQueue(LinkQueue *Q,DataType e);
int DeQueue(LinkQueue *Q,DataType *e);//判断是不是回文的函数，是返回1，不是返回0
int funtion(LSnode *s,LinkQueue *Q) {
char c;
while((c=getchar())!='@')
{stackpush(s,c);EnQueue(Q,c);
}
while(!stacknotempty(s))
{char a,b;stackpop(s,&a);DeQueue(Q,&b);if(a!=b)return 0;}
return 1;
}int main() {
LSnode *s;
LinkQueue Q;
s=stackinitiate();
InitQueue(&Q);
printf("请输入要判断的字符序列,并以@为结束符的字符(按Enter结束)\n");
if(funtion(s,&Q))printf("该字符序列是回文");
elseprintf("该字符序列不是回文");return 0;
}//链栈的运算
//链栈的初始化
LSnode * stackinitiate()
{LSnode * H;H=(LSnode *)malloc(sizeof(LSnode));
if(H==NULL)exit(1);H->next=NULL;return H;
}
//判断栈空
int stacknotempty(LSnode *H)
{if(H->next==NULL)return 1;else return 0;
}
//入栈
int stackpush(LSnode *H,DataType x)
{LSnode *p;if((p=(LSnode *)malloc(sizeof(LSnode)))==NULL){printf("no place\n");return 0;}
p->data=x;
p->next=H->next;
H->next=p;
return 1;
}
//出栈
int stackpop(LSnode *H,DataType *d)
{ LSnode *p=H->next;
if(p==NULL){printf("stack is empty\n");return 0;}
H->next=p->next;
*d=p->data;
free(p);
return 1;
}
//取栈顶元素
int stacktop(LSnode *H,DataType *d)
{LSnode *p=H->next;
if(p==NULL){printf("stack is empty\n");return 0;}
*d=p->data;
return 1;
}//链队列的运算
//建立空队列
void InitQueue(LinkQueue *Q) {
Q->rear=NULL;
Q->front=NULL;
}
int Queuenotempty(LinkQueue *Q)
{if(Q->front==NULL)return 1;
else return 0;
}
//插入元素e为Q的新的队尾元素
int EnQueue(LinkQueue *Q,DataType e) {
Queueptr p;
p=(Queueptr)malloc(sizeof(QNode));
if (!p) exit (0);
p->data=e;
p->next=NULL;
if(Q->rear!=NULL)Q->rear->next=p;
Q->rear=p;
if(Q->front==NULL)Q->front=p;
return 1;
}
//若队列不空，则删除Q的队头元素，用e返回其值，并返回OK
int DeQueue(LinkQueue *Q,DataType *e) {
Queueptr p;
if(Q->front==NULL) return 0;
else{
*e=Q->front->data;
p=Q->front;
Q->front=Q->front->next;
if(Q->front==NULL) Q->rear=NULL;
free (p);
return 1;
}
}

2、输入的任意一个非负十进制数，输出与其对应的八进制数

#include<stdio.h>
#include<stdlib.h>
#define MaxStackSize 100
typedef int DataType;typedef struct
{ DataType stack[MaxStackSize];int top;}SeqStack;void StackInitiate(SeqStack *S)
{S->top=0;
}int StackNotEmpty(SeqStack *S)
{if(S->top<=0) return 0;else return 1;
}int stackpush(SeqStack *S,DataType x)
{if(S->top>=MaxStackSize){printf("no place\n");return 0;}
else
{S->stack[S->top]=x;S->top++;return 1;
}
}int stackpop(SeqStack *S,DataType *d)
{if(S->top<=0){printf("stack is empty\n");return 0;}
else
{S->top--;
*d=S->stack[S->top];
return 1;
}
}
/*int stacktop(SeqStack S,DataType *d)
{if(S.top<=0){printf("stack is empty\n");return 0;}
else
{*d=S.stack[S.top-1];
return 1;
}
}*/void conversion(SeqStack *s,DataType d)
{//十进制转化为八进制；
while(d)
{stackpush(s,d%8);d/=8;
}
printf("0");
while(StackNotEmpty(s))
{int x;stackpop(s,&x);printf("%d",x);
}
return ;}int main()
{SeqStack *s;int d;s=(SeqStack*)malloc(sizeof(SeqStack)) ;StackInitiate(s);scanf("%d",&d);conversion(s,d);
return 0;}

3、括号匹配

#include<stdio.h>
#include<stdlib.h>
typedef char DataType;
//定义链栈
typedef struct snode
{DataType data;struct snode *next;
}LSnode,*LinkStack;//链栈的基本操作声明
LSnode * stackinitiate();
int stacknotempty(LSnode *H);
int stackpush(LSnode *H,DataType x);
int stackpop(LSnode  *H /*DataType d*/);int Judge(char st[])//判断表达式括号是否匹配
{LinkStack H;H=stackinitiate(); int i=0;while(st[i]!='\0'){if(st[i]=='('){stackpush(H,st[i]);}if(st[i]==')'){if(stacknotempty(H)){printf("括号不匹配");return 1;}stackpop(H);}i++;}if(stacknotempty(H))printf("括号匹配");else printf("括号不匹配");return 1;}int main()
{char ch,str[80];int flag=1;while(flag){printf("Input the expression string ended whith '#':\n");gets(str);Judge(str);printf("\nDo you want to continue?(y/n):\n");scanf("%c",&ch);getchar();if(ch=='n'||ch=='N')flag=0;}return 0;
}//链栈的运算
//链栈的初始化
LSnode * stackinitiate()
{LSnode * H;H=(LSnode *)malloc(sizeof(LSnode));
if(H==NULL)exit(1);H->next=NULL;return H;
}
//判断栈空
int stacknotempty(LSnode *H)
{if(H->next==NULL)return 1;else return 0;
}
//入栈
int stackpush(LSnode *H,DataType x)
{LSnode *p;if((p=(LSnode *)malloc(sizeof(LSnode)))==NULL){printf("no place\n");return 0;  }
p->data=x;
p->next=H->next;
H->next=p;
return 1;
}
//出栈
int stackpop(LSnode *H  /*DataType d*/)
{ LSnode *p=H->next;
if(p==NULL){printf("stack is empty\n");return 0;}
H->next=p->next;
//*d=p->data; 
free(p);
return 1;
}
//取栈顶元素
int stacktop(LSnode *H,DataType *d)
{LSnode *p=H->next;
if(p==NULL){printf("stack is empty\n");return 0;}
*d=p->data;
return 1;
}

4、解决舞伴问题

#include <stdio.h>
#include <string.h>
#include <math.h>
#include<stdlib.h>
# define maxsize  100
typedef struct{char name[20];char sex;  //性别，'F'表示女性，'M'表示男性}Person;
typedef  struct{Person  data[maxsize];int  front, rear;} Queue;void  InitQueue(Queue *Q){Q->front=Q->rear=0;}
int  EmptyQueue(Queue *Q){if(Q->front==Q->rear) return 1;else return 0;}
void InQueue(Queue *Q, Person x) {if ((Q->rear+1)% maxsize ==Q->front) printf("overflow!");else{Q->rear=(Q->rear+1)% maxsize;Q->data[Q->rear]=x;
}}
void OutQueue(Queue *Q, Person *x) {if(Q->front==Q->rear)return;else{Q->front= (Q->front+1)% maxsize;*x=Q->data[Q->front];
}}void DancePartner(Person dancer[],int num){//结构数组dancer中存放跳舞的男女，num是跳舞的人数。int i;Person p;Queue Mdancers,Fdancers;InitQueue(&Mdancers);InitQueue(&Fdancers);for(i=0;i<num;i++){//依次将跳舞者依其性别入队if(dancer[i].sex=='F'){InQueue(&Mdancers,dancer[i]);}else{InQueue(&Fdancers,dancer[i]);}}printf("配对成功的舞伴: \n \n");while(!EmptyQueue(&Fdancers)&&!EmptyQueue(&Mdancers)){//依次输出男女舞伴名OutQueue(&Fdancers,&p);printf("%s  ",p.name);OutQueue(&Mdancers,&p);printf("%s\n",p.name);}if(!EmptyQueue(&Fdancers)){ //输出女士剩余人数及队头女士的名字printf("\n 有 %d 位女士在排队等待下一轮.\n",abs(Mdancers.front-Fdancers.rear));OutQueue(&Mdancers,&p); //取队头printf("%s 将在下一轮中第一个配对舞伴. \n",p.name);}else{printf("\n 有 %d 位男士在排队等待下一轮.\n",abs(Fdancers.front-Fdancers.rear));OutQueue(&Fdancers,&p); //取队头printf("%s 将在下一轮中第一个配对舞伴. \n",p.name);}}//DancerPartners    
int main(){Person dancer[20];strcpy(dancer[0].name, "张三");dancer[0].sex='M';strcpy(dancer[1].name, "李四");dancer[1].sex='M';strcpy(dancer[2].name, "王二");dancer[2].sex='M';	strcpy(dancer[3].name, "丽丽");dancer[3].sex='F';strcpy(dancer[4].name, "小芳");dancer[4].sex='F';DancePartner(dancer,5);return 0;
}