资源描述：
《24点算法的java和c语言源码》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。
1、24点算法的Java版和C语言版源码Java版共2个类：Application.java和Node.java==Application.java==packagenum24;publicclassApplication{doublenum[]=newdouble[4];booleanmark[]=newboolean[4];/***获得k个数运算，结果为result的第一个Node，比如get(24,4)*@paramresult*@paramn*@return*/publicNodeget(double
2、result,intn){Nodeleft=null,right=null;if(n<=0){returnnull;}//如果个数小于0，返回空for(inti=0;i<4;i++){if(mark[i]){continue;//如果已经打上标志，继续找下一个}mark[i]=true;//如果没有打标志，就打上标志，并且对其进行处理//如果只有一个数并且这个数就是给出的结果，就返回一个只有一个数的节点if(result==num[i]&&n==1){returnnewNode(num[i]);}left
3、=get(result-num[i],n-1);if(left!=null){returnnewNode(0.0,"+",left,newNode(num[i]));}left=get(result+num[i],n-1);if(left!=null){returnnewNode(0.0,"-",left,newNode(num[i]));}left=get(result*num[i],n-1);if(left!=null){returnnewNode(0.0,"/",left,newNode(num[i
4、]));}if(Math.abs(num[i])>1e-10){left=get(result/num[i],n-1);if(left!=null){returnnewNode(0.0,"*",left,newNode(num[i]));}}for(intj=0;j<4;j++){if(mark[j]){continue;}mark[j]=true;if(result==num[i]*num[j]&&n==2){//a*breturnnewNode(0.0,"*",newNode(num[i]),newN
5、ode(num[j]));}left=get(result+num[i]*num[j],n-2);//a*b-(c?d)=resultif(left!=null){right=newNode(0.0,"*",newNode(num[i]),newNode(num[j]));returnnewNode(0.0,"-",left,right);}left=get(result-num[i]*num[j],n-2);//a*b+(c?d)=resultif(left!=null){right=newNode(0
6、.0,"*",newNode(num[i]),newNode(num[j]));returnnewNode(0.0,"+",left,right);}if(Math.abs(num[j])>1e-10){if(result==num[i]/num[j]&&n==2){returnnewNode(0.0,"/",newNode(num[i]),newNode(num[j]));}left=get(result+num[i]/num[j],n-2);//a/b-(c?d)=result==>c?d=resul
7、t+a/bif(left!=null){right=newNode(0.0,"/",newNode(num[i]),newNode(num[j]));returnnewNode(0.0,"-",left,right);}left=get(result-num[i]/num[j],n-2);if(left!=null){right=newNode(0.0,"/",newNode(num[i]),newNode(num[j]));returnnewNode(0.0,"+",left,right);}}if(r
8、esult==num[i]-num[j]&&n==2){returnnewNode(0.0,"-",newNode(num[i]),newNode(num[j]));}if(Math.abs(num[i]-num[j])>1e-10){left=get(result/(num[i]-num[j]),n-2);if(left!=null){right=newNode(0.0,"-",newNode(num[i]),newNode
