比如这段24点的代码(剪切)int oindex[5][3]={2,4,6,3,4,6,2,5,6,3,5,6,4,5,6};
int dindex[5][4]={0,1,3,5,0,1,2,5,0,1,3,4,0,1,2,4,0,1,2,3};
char opera[]="+-*/";
char _oper[]="+++++-++*++/+-++--+-*+-/+*++*-+**+*/+/++/-+/*+//-++-+--+*-+/--+-----*--/-*+-*--**-*/-/+-/--/*-//*++*+-*+**+/*-+*--*-**-/**+**-*****/*/+*/-*/**///++/+-/+*/+//-+/--/-*/-//*+/*-/**/*///+//-//*///";
int _dindex[24][4]={1,2,3,4, 1,2,4,3, 1,3,2,4, 1,3,4,2, 1,4,2,3, 1,4,3,2,
2,1,3,4, 2,1,4,3, 2,3,4,1, 2,3,1,4, 2,4,1,3, 2,4,3,1,
3,1,2,4, 3,1,4,2, 3,2,1,4, 3,2,4,1, 3,4,1,2, 3,4,2,1,
4,1,2,3, 4,1,3,2, 4,2,3,1, 4,2,1,3, 4,3,2,1, 4,3,1,2};
char _TreeNode[MAXTREE][9]; //0~1:data,2,bit,3-4:left,5-6:right,6-7:parent
char _TreeStau[MAXTREE]; //1:user,2:unuser
int _TreeData[2]; //temp data for Tree structure
运算会很慢 我们试着将------<暂时不外漏>就快了 希望得到老F的帮助 (问一句,有加音效的必要吗?),呵,不加进程会很快的,二个月, 要加就麻烦了 |