免费注册 查看新帖 |

Chinaunix

  平台 论坛 博客 文库
最近访问板块 发新帖
查看: 2631 | 回复: 4
打印 上一主题 下一主题

[算法] 请教一个方法 [复制链接]

论坛徽章:
0
1 [报告]
发表于 2008-12-03 10:08 |显示全部楼层
#include <stdio.h>

int fun1() { printf("call fun1\n"); }
int fun2() { printf("call fun2\n"); }
int fun3() { printf("call fun3\n"); }
int fun4() { printf("call fun4\n"); }
int fun5() { printf("call fun5\n"); }

typedef int (*fun_t)();

int mask[5] = {1, 2, 16, 8, 4};
fun_t funs[5] = {fun5, fun4, fun1, fun2, fun3};

void test(int num)
{
&nbsp;&nbsp;&nbsp;&nbsp;int i;
&nbsp;&nbsp;&nbsp;&nbsp;for (i = 0; i < 5; i++)
&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if ((num & mask[i]) != 0)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;(*funs[i])();

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;// fun1, fun2, fun3不重复调用
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if (i >= 2 && num >= mask[i])
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;break;
&nbsp;&nbsp;&nbsp;&nbsp;}
}

int main()
{
&nbsp;&nbsp;&nbsp;&nbsp;int num;
&nbsp;&nbsp;&nbsp;&nbsp;for (num = 0; num < 32; num++)
&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;printf("num = %d\n", num);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;test(num);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;printf("\n\n");
&nbsp;&nbsp;&nbsp;&nbsp;}
}


怎么样才叫好的方法呢?

论坛徽章:
0
2 [报告]
发表于 2008-12-03 10:09 |显示全部楼层
运行结果
num = 0


num = 1
call fun5


num = 2
call fun4


num = 3
call fun5
call fun4


num = 4
call fun3


num = 5
call fun5
call fun3


num = 6
call fun4
call fun3


num = 7
call fun5
call fun4
call fun3


num = 8
call fun2


num = 9
call fun5
call fun2


num = 10
call fun4
call fun2


num = 11
call fun5
call fun4
call fun2


num = 12
call fun2


num = 13
call fun5
call fun2


num = 14
call fun4
call fun2


num = 15
call fun5
call fun4
call fun2


num = 16
call fun1


num = 17
call fun5
call fun1


num = 18
call fun4
call fun1


num = 19
call fun5
call fun4
call fun1


num = 20
call fun1


num = 21
call fun5
call fun1


num = 22
call fun4
call fun1


num = 23
call fun5
call fun4
call fun1


num = 24
call fun1


num = 25
call fun5
call fun1


num = 26
call fun4
call fun1


num = 27
call fun5
call fun4
call fun1


num = 28
call fun1


num = 29
call fun5
call fun1


num = 30
call fun4
call fun1


num = 31
call fun5
call fun4
call fun1


论坛徽章:
0
3 [报告]
发表于 2008-12-03 10:10 |显示全部楼层
如果函数12345调用顺序有影响的话,则使用if elseif else会更直接

论坛徽章:
0
4 [报告]
发表于 2008-12-03 12:19 |显示全部楼层
上面这个不错

论坛徽章:
0
5 [报告]
发表于 2008-12-05 12:29 |显示全部楼层
忽然觉得表驱动法,也是不错的

回头再研究下《代码大全》表驱动那一章
您需要登录后才可以回帖 登录 | 注册

本版积分规则 发表回复

  

北京盛拓优讯信息技术有限公司. 版权所有 京ICP备16024965号-6 北京市公安局海淀分局网监中心备案编号:11010802020122 niuxiaotong@pcpop.com 17352615567
未成年举报专区
中国互联网协会会员  联系我们:huangweiwei@itpub.net
感谢所有关心和支持过ChinaUnix的朋友们 转载本站内容请注明原作者名及出处

清除 Cookies - ChinaUnix - Archiver - WAP - TOP