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

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

Java 版共 2 个类：Application.java 和 Node.java

== Application.java==

package num24;

public class Application {

double num[] = new double[4];

boolean mark[] = new boolean[4];

/**

Node left = null, right = null;

if (n <= 0) {

return null;

} //如果个数小于 0，返回空

for (int i = 0; i < 4; i++) {

if (mark[i]) {

continue; //如果已经打上标志，继续找下一个

}

mark[i] = true; //如果没有打标志，就打上标志，并且对其进行处理

//如果只有一个数并且这个数就是给出的结果，就返回一个只有一个数的节点

}

left = get(result + num[i], n - 1);

if (left != null) {

return new Node(0.0, "-", left, new Node(num[i]));

}

left = get(result * num[i], n - 1);

if (left != null) {

return new Node(0.0, "/", left, new Node(num[i]));

}

if (Math.abs(num[i]) > 1e-10) {

if (mark[j]) {

continue;

}

mark[j] = true;

if (result == num[i] * num[j] && n == 2) { //a*b

return new Node(0.0, "*", new Node(num[i]), new Node(num[j]));

}

left = get(result + num[i] * num[j], n - 2); //a*b-(c?d)=result

if (left != null) {

right = new Node(0.0, "*", new Node(num[i]), new Node(num[j]));

}

if (Math.abs(num[j]) > 1e-10) {

if (result == num[i] / num[j] && n == 2) {

return new Node(0.0, "/", new Node(num[i]), new Node(num[j]));

}

left = get(result + num[i] / num[j], n - 2); //a/b-(c?d)=result==>c?d=result+a/b

if (left != null) {

right = new Node(0.0, "/", new Node(num[i]), new Node(num[j]));

return new Node(0.0, "-", left, right);

}

}

if(result==num[i]-num[j]&&n==2){

return new Node(0.0,"-",new Node(num[i]),new Node(num[j]));

}

if(Math.abs(num[i]-num[j])>1e-10){

left=get(result/(num[i]-num[j]),n-2);

if(left!=null){

mark[i]=false;

} //end for(int i...

return null;

}

public void output(Node node) {

if (node == null) {

return;

}

}

else {

output(node.left);

}

}

if (!node.name.trim().equals("")) {

System.out.print(node.name);

}

else {

System.out.print(node.num);