4 beliebige Zahlen von 1 bis 13 addieren, subtrahieren, multiplizieren und dividieren, um 24 Punkte zu berechnen.
Umsetzungsprinzip:
1) Ordne und kombiniere 4 Zahlen
2) Berechnen Sie die Möglichkeit jeder Permutation und Kombination
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[] inputs) { int[] digits = new int[4]; for (int i = 0; i < inputs.length; i++) { digits[i] = Integer.valueOf(inputs[i]); } return new String[]{calc(digits)}; } private String calc(final int data[]){ final Set<String> out = new HashSet<String>(); Kombinationsziffer = neue Kombination() { @Override protected void handle(int[] Ergebnis) { final int[] r = Ergebnis; Kombination oper = neue Kombination(){ @Override protected void handle(int[] c) { double x = r[0]; for (int i = 0; i < r.length - 1; i++) { x = doCalculate(x, r[i + 1], c[i ]); } if(Math.abs(Math.abs(x) - target) < precision || Math.abs(Math.abs(1/x) - target) < precision){ StringBuilder sb = new StringBuilder(); for (int j = 0; j < r.length; j++) { sb.append(r[j]); if(j != r.length - 1){ sb.append(getOperation(c[ j])); } } out.add(sb.toString()); } } }; 3}, data.length - 1, true); }; digit.combine(data); for (String string : out) { sb.append(" /n"); } return sb.toString(); } private double doCalculate(double x, double y, int operation){ switch (operation) { case 0: Rückkehr x + y; Fall 2: Rückkehr x / y; Standard: Rückkehr 0; } } private static String getOperation(int) ) { case 0: return „+“; case 2: return „*“; case 3: return „/“; main(String[] args) { System.out.println(new Cal24().calc(new int[]{1, 5, 5, 5}));Kombination.java
öffentliche abstrakte Klasse Kombination { private boolesche Wiederholung; private int total = 0; public void combin(int data[]){ combin(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 = int times = data.length; (int)Math.pow(times, count); for (int i = 0; i < size; i++) { int[] result = toArray(data, i, count); if(result != null){ handle( result); total ++; } } } private int[] toArray(int data[], int i, int count){ int [] indices = new int[count]; data.length; for (int j = 0; j < count; j++) { int temp = 0; if(i > 0){ i = (i - temp)/times; ] = temp; } if(!repeat){ //Wiederholung entfernen for (int x = 0; x < count; x++) { for(int y = 0; y < count; y++){ if(x != y){ if(indices[x] == indices[y]) return null } } } } int [] result = new int[count]; x++) { int selected = data[indices[x]]; result[x] = selected; Ergebnis);}Das Obige ist der gesamte Inhalt dieses Artikels. Ich hoffe, er gefällt Ihnen allen.