📄 24finished.c
字号:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#define MAX 13
#define OK 1
#define TRUE 1
#define FALSE 0
#define ERROR 0
#define OVERFLOW -2
#define OPSETSIZE 7
#define STACK_INIF_SIZE 50
#define STACKINCREMENT 10
typedef int status;
int number[2][4];
enum
{
eNumber = 0, //操作数
eOperator = 1 //算子
};
int oper[7]={43,45,42,47,40,41,35};
typedef struct sqlist{
int bol;//bol is 0 when num_ch is a number;bol is 1 when the num_ch is a oprater
int num_ch;
struct sqlist *next;
}sqlist;
typedef struct sqstack{
int *base;
int *top;
int stacksize;
}sqstack;
unsigned char Prior[7][7] = { // 表3.1 算符间的优先关系
'>','>','<','<','<','>','>',
'>','>','<','<','<','>','>',
'>','>','>','>','<','>','>',
'>','>','>','>','<','>','>',
'<','<','<','<','<','=',' ',
'>','>','>','>',' ','>','>',
'<','<','<','<','<',' ','='
};
char OPSET[OPSETSIZE]={'+' , '-' , '*' , '/' ,'(' , ')' , '#'};
status init_sq(sqlist *l){
// sqlist *l;
l=(sqlist*)malloc(sizeof(sqlist));
if(l==NULL){
exit(OVERFLOW);
}
l->next=NULL;
return OK;
}
status insert_sq(sqlist **p,int e,int bl){
sqlist *q;
q=(sqlist*)malloc(sizeof(sqlist));
q->num_ch=e;
q->bol=bl;
q->next=NULL;
(*p)->next=q;
(*p)=(*p)->next;
// printf("insert %d,%dis succssed!\n",e,bl);
return OK;
}
/*status chang2(char *s , sqlist *l)
{
unsigned int t;
//data da;
sqlist *p=l;
int a,bl;
//char *s=ss;
for(t=0;t<strlen(s);t++){
if(s[t]>47&&s[t]<58){
a=s[t]-48;
bl=0;
insert_sq(&p,a,bl);
}
else
{
a=s[t];
bl=1;
insert_sq(&p,a,bl);
}
}
return OK;
}*/
int check(sqlist l)
{
int right=1,find=0,i;
sqlist *q=&l;
q=q->next ;
for (;q->next!=NULL;q=q->next){
if(q->bol==1){
if(q->num_ch <=39||q->num_ch>57||q->num_ch==44||q->num_ch==46){
right=0;
printf("the %c is not allowed here!\n");
}
}
else {
find=0;
for(i=0;i<4;i++){
if(number[1][i]==0&&number[0][i]==q->num_ch ){
number[1][i]=1;
find=1;
break;
}
}
if(find==0){
right=0;
printf("the %d is not found!\n",q->num_ch );
}
}
}//end for
// printf("the right is %d\n",right);
return right;
}
int chang(char *s,sqlist *l){
int t=0;
unsigned int i=0;
int bl,ch;
int a1,a2,a;
sqlist *p=l;
for (;i<strlen(s);i++){
if(s[i]>47&&s[i]<58&&t==0){
a1=(int)s[i]-48;
t++;
}
else if(s[i]>47&&s[i]<58&&t==1){
a2=(int)s[i]-48;
a=a1*10+a2;
t++;
}
else if(s[i]<48&&s[i]>39&&s[i]!=44&&s[i]!=46){
if(t==1){
bl=0;
insert_sq(&p,a1,bl);
t=0;
}
else if(t==2){
bl=0;
insert_sq(&p,a,bl);
t=0;
}
bl=1;
ch=(int)s[i];
insert_sq(&p,ch,bl);
t=0;
}
// printf("the i is %d\n",i);
} //end for
i=strlen(s)-1;
if(s[i]>47&&s[i]<58){
if(s[i-1]>47&&s[i-1]<58){
bl=0;
insert_sq(&p,a,bl);
}
else {
bl=0;
insert_sq(&p,a1,bl);
}
}
bl=1;
a=35;
insert_sq(&p,a,bl);
printf("chang is OK\n");
return (check(*l));
}
status print_sq(sqlist *l)
{
sqlist *p=l;
if(l){
for (p=p->next ;p!=NULL;p=p->next){
printf("%d,%d\n",p->num_ch,p->bol );
//printf("OK!");
}
}
else printf("空!");
return OK;
}
int Operate(int a,int theta, int b) {
// printf("a=%d,theta=%c,b=%d\n",a,theta,b);
switch(theta) {
case 43: return a+b;
case 45: return a-b;
case 42: return a*b;
case 47:
{
if(b==0){
printf("除数不能为0!\n");
exit(ERROR);
}
if (a%b==0){
return a/b;
}
else {
//printf("不能为小数\n");
return -1;
// exit(0);
}
}
default : return 0;
}
}
int ReturnOpOrd(char op,char* TestOp) {
int i;
for(i=0; i< OPSETSIZE; i++) {
if (op == TestOp[i]) return i;
}
return 0;
}
char precede(char Aop, char Bop) {
// printf("%c\n",Prior[ReturnOpOrd(Aop,OPSET)][ReturnOpOrd(Bop,OPSET)]);
// printf("%c, %c\n",Aop,Bop);
return Prior[ReturnOpOrd(Aop,OPSET)][ReturnOpOrd(Bop,OPSET)];
}
status initstack(sqstack *s){
(s)->base = (int*)malloc(STACK_INIF_SIZE*sizeof(int));
if((s)->base==NULL) exit(OVERFLOW);
(s)->top=(s)->base;
(s)->stacksize = STACK_INIF_SIZE;
// printf("initstack is finished!\n");
return OK;
}
int gettop(sqstack *s){
int e;
if(s->top==s->base){
printf("NULL1\n");
return 0;
}
e=*(s->top-1);
// printf("gettop %d is OK!\n",e);
return e;
}
status push(sqstack *s,int e){
if(s->top-s->base>=s->stacksize){
s->base=(int*)realloc(s->base,(s->stacksize+STACKINCREMENT)*sizeof(int));
if(!s->base) exit(OVERFLOW);
s->stacksize+= STACKINCREMENT;
}
*(s->top++)=e;
// printf("push %d is OK\n",e);
return OK;
}
status pop(sqstack *s,int *e){
if(s->top==s->base){
printf("NULL2\n");
return ERROR;
}
*e=*(--s->top);
// printf("pop %d is OK!\n",*e);
return OK;
}
int EvaluateExpression(char* MyExpression) { // 算法3.4
// 算术表达式求值的算符优先算法。
// 设OPTR和&&OPND分别为运算符栈和运算数栈，OP为运算符集合。
int result;
sqstack OPTR; // 运算符栈，字符元素
sqstack OPND; // 运算数栈，实数元素
// char TempData[30];
int c,bl,a,b,theta,top;
//char ch;
sqlist *q,l;
char *s=MyExpression;
init_sq(&l);
if(chang(s,&l)!=0){
q=&l;
initstack(&OPTR);
push(&OPTR, 35);
initstack (&OPND);
q=q->next;
c=q->num_ch;
bl=q->bol;
// strcpy(TempData,"\0");
while ((c!= 35 || gettop(&OPTR)!=35)){
printf("while start!\n");
if (bl!=1) {
push(&OPND, c);
q=q->next;
c=q->num_ch;
bl=q->bol;
} // 不是运算符则进栈
else {
// ch=(char)c;
top=gettop(&OPTR);
// topch=(char)top;
printf("top %c",top);
switch (precede(top, c)) {
// c2=c;
case '<':
// printf("case <!\n"); // 栈顶元素优先权低
push(&OPTR, c);
// if(q=q->next!=NULL){
q=q->next;
c=q->num_ch;
bl=q->bol;
// }
break;
case '=': // 脱括号并接收下一字符
pop(&OPTR, &c);
// if(q=q->next!=NULL){
q=q->next;
c=q->num_ch;
bl=q->bol;
// }
break;
case '>': // 退栈并将运算结果入栈
pop(&OPTR, &theta);
pop(&OPND, &b);
pop(&OPND, &a);
//thetach=(char)theta;
printf("q->num_ch is %d\n",q->num_ch);
push(&OPND, Operate(a, theta, b));
// printf("%d\n",q);
/* if (q->num_ch !=35){
q=q->next;
c=q->num_ch;
bl=q->bol;
printf("%d\n",c);*/
// }
break;
default :
printf("have not this oper!\n");
return 0;
} // switch
}//else
} // while
result=gettop(&OPND);
return result;
}
else {
printf("your put is not right !\n");
return 0;
}
} // EvaluateExpression
int randomm()
{
int i=0;
srand((unsigned)time(NULL));
for (;i<4;i++){
number[0][i]=0;
number[0][i]=rand();
number[0][i]%=13;
number[0][i]++;
}
return number[2][4];
}
int CalcOneExpress(int expression[][2])
{
// 算术表达式求值的算符优先算法。
// 设OPTR和&&OPND分别为运算符栈和运算数栈，OP为运算符集合。
int index=0,result,c,theta,a,b;
sqstack OPTR; // 运算符栈，字符元素
sqstack OPND; // 运算数栈，实数元素
initstack(&OPTR);
push(&OPTR, 35);
initstack (&OPND);
c=expression[index][0];
while (c!= 35 || gettop(&OPTR)!=35){
// printf("while start!\n");
if (expression[index][1]!=1) {
push(&OPND, c);
index++;
c=expression[index][0];
} // 不是运算符则进栈
else {
switch (precede(gettop(&OPTR), c)) {
case '<':
// printf("case <!\n"); // 栈顶元素优先权低
push(&OPTR, c);
index++;
c=expression[index][0];
break;
case '=': // 脱括号并接收下一字符
pop(&OPTR, &c);
index++;
c=expression[index][0];
break;
case '>': // 退栈并将运算结果入栈
pop(&OPTR, &theta);
pop(&OPND, &b);
pop(&OPND, &a);
// printf("q->num_ch is %d\n",q->num_ch);
push(&OPND, Operate(a, theta, b));
/* if (q->num_ch !=35){
index++;
c=expression[index][0];
printf("%d\n",c);*/
// }
break;
default :
printf("have not this oper!\n");
return 0;
} // switch
}//else
} // while
result=gettop(&OPND);
// printf("the result is %d\n",result);
return result;
} // EvaluateExpression
/*status CombineResult(int expression[][2],int n)
{
char s[15];
*/
int Equal24(int n)
{
if(n==24){
printf("the result is %d\n",n);
return TRUE;
}
else return FALSE;
}
int CalcArray1(int iNumInput[2][4])
{
// a * b * c * d //7 number
int expression[8][2],ii,jj,kk;
int i,j,k,l,dRes;
for(i=0;i<4;i++)
{
for(j=0;j<4;j++)
{
if(j==i)
{
continue;
}
for(k=0;k<4;k++)
{
if(k==i||k==j)
{
continue;
}
for(l=0;l<4;l++)
{
if(l==i||l==j||l==k)
{
continue;
}
expression[0][0]=iNumInput[0][i];
expression[2][0]=iNumInput[0][j];
expression[4][0]=iNumInput[0][k];
expression[6][0]=iNumInput[0][l];
expression[0][1]=eNumber;
expression[2][1]=eNumber;
expression[4][1]=eNumber;
expression[6][1]=eNumber;
for (ii=0;ii<4;ii++)
{
for (jj=0;jj<4;jj++)
{
for (kk=0;kk<4;kk++)
{
expression[1][0] = oper[ii];
expression[1][1] = eOperator;
expression[3][0] = oper[jj];
expression[3][1] = eOperator;
expression[5][0] = oper[kk];
expression[5][1] = eOperator;
expression[7][0] = oper[6];
expression[7][1] = eOperator;
dRes = CalcOneExpress(expression);
if(Equal24(dRes))
{
// CombineResult(expression, 7);//组织结果表达式
// printf("%d,%d,%d,%d,%d,%d,%d\n",i,ii,j,jj,k,kk,l);
// printf("%d%c\n",expression[i][0],oper[ii]);
printf("%d%c%d%c%d%c%d\n",expression[0][0],oper[ii],expression[2][0],oper[jj],expression[4][0],oper[kk],expression[6][0]);
return TRUE;
}
}
}
}//end of for oper
}
}
}
}
return FALSE;
}
int CalcArray2(int iNumInput[2][4])
{
// (a * b) * c * d //9 number
int expression[10][2];
int ii,jj,i,j,k,l,kk;
int dRes;
printf("CalcArray2\n");
for(i=0;i<4;i++)
{
for(j=0;j<4;j++)
{
if(j==i)
{
continue;
}
for(k=0;k<4;k++)
{
if(k==i||k==j)
{
continue;
}
for(l=0;l<4;l++)
{
if(l==i||l==j||l==k)
{
continue;
}
expression[1][0]=iNumInput[0][i];
expression[3][0]=iNumInput[0][j];
expression[6][0]=iNumInput[0][k];
expression[8][0]=iNumInput[0][l];
expression[1][1]=eNumber;
expression[3][1]=eNumber;
expression[6][1]=eNumber;
expression[8][1]=eNumber;
for (ii=0;ii<4;ii++)
{
for (jj=0;jj<4;jj++)
{
for (kk=0;kk<4;kk++)
{
expression[2][0] = oper[ii];
expression[2][1] = eOperator;
expression[5][0] = oper[jj];
expression[5][1] = eOperator;
expression[7][0] = oper[kk];
expression[7][1] = eOperator;
expression[9][0] = oper[6];
expression[9][1] = eOperator;
expression[0][0] = oper[4];
expression[0][1] = eOperator;
expression[4][0] = oper[5];
expression[4][1] = eOperator;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -