任意4个1-13数字,加减乘除计算24点。
实现原理:
1)排列组合4个数字
2)计算每次排列组合的可能性
Cal24.java
import java.util.HashSet; import java.util.Set; public class Cal24 { private static final double precision = 0.00001; private static final int target = 24; public String[] execute(String[] inputs) { int[] digits = new int[4]; for (int i = 0; iout = new HashSet (); Combination digit = new Combination() { @Override protected void handle(int[] result) { final int[] r = result; Combination oper = new Combination(){ @Override protected void handle(int[] c) { double x = r[0]; for (int i = 0; i
Combination.java
public abstract class Combination { private boolean repeat; private int total = 0; public void combine(int data[]){ combine(data, data.length, false); } public void combine(int data[], int count){ combine(data, count, false); } public void combine(int data[], int count, boolean repeat){ this.repeat = repeat; int times = data.length; int size = (int)Math.pow(times, count); for (int i = 0; i0){ temp = i%times; i = (i - temp)/times; } indices[j] = temp; } if(!repeat){ //remove repetition for (int x = 0; x
以上所述就是本文的全部内容了,希望大家能够喜欢。