24点算法的Java和C语言源码.doc

24点算法的Java版和C语言版源码Java版共2个类：Application.java 和 Node.java= Application.java=package num24;public class Application double num = new double4; boolean mark = new boolean4; /* * 获得k个数运算，结果为result的第一个Node，比如get(24,4) * param result * param n * return */ public Node get(double result, int n) Node left = null, right = null; if (n = 0) return null; /如果个数小于0，返回空 for (int i = 0; i 1e-10) left = get(result / numi, n - 1); if (left != null) return new Node(0.0, *, left, new Node(numi); for (int j = 0; j 1e-10) if (result = numi / numj & n = 2) return new Node(0.0, /, new Node(numi), new Node(numj); left = get(result + numi / numj, n - 2); /a/b-(c?d)=result=c?d=result+a/b if (left != null) right = new Node(0.0, /, new Node(numi), new Node(numj); return new Node(0.0, -, left, right); left = get(result - numi / numj, n - 2); if (left != null) right = new Node(0.0, /, new Node(numi), new Node(numj); return new Node(0.0, +, left, right); if(result=numi-numj&n=2) return new Node(0.0,-,new Node(numi),new Node(numj); if(Math.abs(numi-numj)1e-10) left=get(result/(numi-numj),n-2); if(left!=null) right=new Node(0.0,-,new Node(numi),new Node(numj); return new Node(0.0,*,left,right); markj=false; /end for(int j. marki=false; /end for(int i. return null; public void output(Node node) if (node = null) return; if (node.left != null) if ( (.equals(+) | .equals(-) & (.equals(*) | .equals(/) System.out.print(); output(node.left); System.out.print(); else output(node.left); if (!.trim().equals() System.out.print(); else System.out.print(node.num); if (node.right != null) if ( (.equals(+) | .equals(-) & (.equals(*) | .equals(/) | (.equals(+) | .equals(-) & (.equals(-) | (!.trim().equals() & (.equals(/) ) System.out.print(); output(node.right); System.out.print(); else output(node.right); /* * * param args */ public static void main(String args) Application app=new Application(); app.num0=Double.parseDouble(args0); app.num1=Double.parseDouble(args1); app.num2=Double.parseDouble(args2); app.num3=Double.parseDouble(args3); double result; Node tree=null; /while(true) result=24.0; / if(result=-1.0)break; app.mark0=false; app.mark1=false; app.mark2=false; app.mark3=false; tree=app.get(result,4); if(tree!=null) app.output(tree); System.out.println(=+result); else System.out.println(No!); / =Node.java=package num24;public class Node public double num; String name; Node left, right = null; public Node() num = 0.0; name = ; left = right = null; public Node(double aNum) this(aNum, ,null,null); public Node(double aNum, String aName, Node aLeft, Node aRight) num = aNum; name = aName; left = aLeft; right = aRight; public void delete() if(left!=null) left.delete(); if(right!=null) right.delete(); left=null; right=null; C 语言版/用二叉树保存表达式，输出无多余括号。#include#include#includeusing namespace std;double n4;bool mark4;class nodepublic:double num;char c;node *left,*right;node()num=0.0;c= ;left=right=NULL;node(double x,char ch= ,node *l=NULL,node *r=NULL)num=x;c=ch;left=l;right=r;void del()if(left!=NULL)left-del();if(right!=NULL)right-del();delete(left);delete(right);node()del();/获得k个数运算，结果为r的node/get(24,4)node *get(double r,int k)int i,j;node *lc,*rc;if(k=0)return NULL;for(i=0;i1e-10)lc=get(r/ni,k-1);if(lc!=NULL)return new node(0.0,*,lc,new node(ni);for(j=0;j1e-10)if(r=ni/nj&k=2)return new node(0.0,/,new node(ni),new node(nj);lc=get(r+ni/nj,k-2);if(lc!=NULL)rc=new node(0.0,/,new node(ni),new node(nj);return new node(0.0,-,lc,rc);lc=get(r-ni/nj,k-2);if(lc!=NULL)rc=new node(0.0,/,new node(ni),new node(nj);return new node(0.0,+,lc,rc);if(r=ni+nj&k=2)return new node(0.0,+,new node(ni),new node(nj);if(fabs(ni+nj)1e-10)lc=get(r/(ni+nj),k-2);if(lc!=NULL)rc=new node(0.0,+,new node(ni),new node(nj);return new node(0.0,*,lc,rc);if(r=ni-nj&k=2)return new node(0.0,-,new node(ni),new node(nj);if(fabs(ni-nj)1e-10)lc=get(r/(ni-nj),k-2);if(lc!=NULL)rc=new node(0.0,-,new node(ni),new node(nj);return new node(0.0,*,lc,rc);markj=false;marki=false;return NULL;void output(node* T)if(T=NULL)return;if(T-left!=NULL)if(T-left-c=+|T-left-c=-)&(T-c=*|T-c=/)coutleft);coutleft);if(T-c!= )coutc;elsecoutnum;if(T-right!=NULL)if(T-right-c=+|T-right-c=-)&(T-c=*|T-c=/)|(T-right-c=+|T-right-c=-)&(T-c=-)|(T-right-c!= )&(T-c=/) )coutright);coutright);int main()double result;node*