今天学的计算机程序的两实现方案

方案一：主要使用回调函数减少冗余

#include<stdio.h>
void menu()
{
printf("** 1.add 2.sub**\n");
printf("** 3.mul 4.div**\n");
printf("** 0. exit \n");
printf("******************\n");
}
int Add(int x, int y)
{
return x + y;
}
int Sub(int x, int y)
{
return x - y;
}
int Mul(int x, int y)
{
return x * y;
}
int Div(int x, int y)
{
return x / y;
}

int Calc(int(pf)(int, int))
{
int x = 0;
int y = 0;
printf(“请输入两个操作数：>”);
scanf_s("%d%d", &x, &y);
printf("%d\n", pf(x, y));
}//这里用到了函数的回调函数理论
int main()
{
int input = 0;
int x = 0;
int y = 0;
do
{
menu();
printf(“请选择：>”);
scanf_s("%d", &input);
switch (input)
{
case 1:
Calc(Add);
break;
case 2:
Calc(Sub);
break;
case 3:
Calc(Mul);
break;
case 4:
Calc(Div);
break;
case 0:
printf(“退出\n”);
break;
default:
printf(“选择错误\n”);
break;
}
} while (input);
return 0;
}
方案二：
使用函数指针数组
#include<stdio.h>
void menu()
{
printf("* 1.add 2.sub**\n");
printf("** 3.mul 4.div**\n");
printf("** 0. exit 5.XOR**\n");
printf("********************\n");
}
int Add(int x, int y)
{
return x + y;
}
int Sub(int x, int y)
{
return x - y;
}
int Mul(int x, int y)
{
return x * y;
}
int Div(int x, int y)
{
return x / y;
}
int XOR(int x, int y)

{
return x ^ y;
}
int main()
{
int input = 0;
int x = 0;
int y = 0;
//pfArr是一个函数指针数组
//我们一般把函数指针数组叫做转移表
int(*pfArr[])(int, int) = {0,Add,Sub,Mul,Div,XOR};
do
{
menu();
printf(“请选择:>”);
scanf_s("%d", &input);
if (input >= 1 && input <= 4)
{
printf(“请输入操作数:>”);
scanf_s("%d%d", &x, &y);
int ret = pfArr[input] (x,y);
printf("%d\n", ret);
}
else if (input == 0)
{
printf(“退出\n”);
}
else
{
printf(“选择错误\n”);
}
} while (input);
return 0;
}