扑克牌计算24点的Java算法实现
2008-12-28 10:33
706 查看
以下是网上找来的代码，感谢原作者的精彩实现。(我已经记不得是什么时候在哪里看来的了，呵呵)
package com.chanson;
/*
* @date Aug 3, 2006
* @project 学习
* @company 个人
* @author chanson
* @version 1.0
*/
import java.util.HashMap;
public class TwentyFour {
private int[] aArray = new int[2];
private int[] bArray = new int[2];
private int[] cArray = new int[2];
private int[] dArray = new int[2];
/**
* main方法
*
* @param args
*/
public static void main(String[] args) {
new TwentyFour().dispose(3, 4, 5, 8);
}
public void dispose(int a, int b, int c, int d){
aArray[0] = a;
aArray[1] = 1;
bArray[0] = b;
bArray[1] = 1;
cArray[0] = c;
cArray[1] = 1;
dArray[0] = d;
dArray[1] = 1;
core(aArray, bArray, cArray, dArray);
}
/**
* 加
*/
public int[] plus(int[] a, int[] b){
if(0 == a[1]){
return new int[]{0,0};
}
if(0 == b[1]){
return new int[]{0,0};
}
int denominator = leaseCommonMultiple(a[1],b[1]);
return new int[]{denominator/a[1]*a[0] + denominator/b[1]*b[0] ,denominator};
}
/**
* 减
* @param a
* @param b
* @return
*/
public int[] reduce(int[] a, int[] b){
if(0 == a[1]){
return new int[]{0,0};
}
if(0 == b[1]){
return new int[]{0,0};
}
int denominator = leaseCommonMultiple(a[1],b[1]);
return new int[]{denominator/a[1]*a[0] - denominator/b[1]*b[0] ,denominator};
}
/**
* 乘
* @param a
* @param b
* @return
*/
public int[] multiply(int[] a, int[] b){
return new int[]{a[0] * b[0], a[1] * b[1]};
}
/**
* 除
* @param a
* @param b
* @return
*/
public int[] divide(int[] a, int[] b){
return new int[]{a[0] * b[1], a[1] * b[0]};
}
/**
* 求最小公倍数
* @param a
* @param b
* @return
*/
public int leaseCommonMultiple(int a, int b){
return a*b/greatestCommonDivisor(a,b);
}
/**
* 求最大公约数
* @param a
* @param b
* @return
*/
public int greatestCommonDivisor(int a, int b) {
if(0 == a && 0 == b){
return 1;
}
if (0 == a) {
return b;
}
if (0 == b) {
return a;
}
if (a > b) {
int c = a;
a = b;
b = c;
}
for (int c = a % b; c > 0; c = a % b) {
a = b;
b = c;
}
return b;
}
/**
* 动态加载符号数
* @param i
* @param a
* @param b
* @return
*/
public int[] dispose(int i, int a[], int[] b){
if(i == 0){
return plus(a, b);
}else if(i == 1){
return reduce(a, b);
}else if(i == 2){
return multiply(a, b);
}else{
return divide(a, b);
}
}
/**
* 动态加载计算数
* @param i
* @param a
* @param b
* @param c
* @param d
* @return
*/
public int[] number(int i, int[] a, int[] b, int[] c, int[] d){
if(i == 0){
return a;
}else if(i == 1){
return b;
}else if(i == 2){
return c;
}else if(i == 3){
return d;
}else{
return new int[]{0,1};
}
}
/**
* 核心算法部分
* @param a
* @param b
* @param c
* @param d
*/
private void core(int[] a, int[] b, int[] c, int[] d) {
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
int count = 0;
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++){
for(int k = 0; k < 4; k++){
for(int m = 0; m < 4; m++){
for(int n = 0; n < 4; n++){
if(n == m)
continue;
for(int o = 0; o < 4; o++){
if(o == m || o == n)
continue;
for(int p = 0; p < 4; p++){
if(p == m || p == n || p == o)
continue;
//类型1：A(A(A(a,b),c),d)
int[] result1 = dispose(k,dispose(j,dispose(i,number(m,a,b,c,d),number(n,a,b,c,d)),number(o,a,b,c,d)),number(p,a,b,c,d));
//类型2：A(A(a,A(b,c)),d)
int[] result2 = dispose(k,dispose(i,number(m,a,b,c,d),dispose(j,number(n,a,b,c,d),number(o,a,b,c,d))),number(p,a,b,c,d));
//类型3：A(a,A(b,A(c,d)))
int[] result3 = dispose(i,number(m,a,b,c,d),dispose(j,number(n,a,b,c,d),dispose(k,number(o,a,b,c,d),number(p,a,b,c,d))));
//类型4：A(a,A(A(b,c),d))
int[] result4 = dispose(i,number(m,a,b,c,d),dispose(k,dispose(j,number(n,a,b,c,d),number(o,a,b,c,d)),number(p,a,b,c,d)));
//类型5：A(A(a,b),A(c,d))
int[] result5 = dispose(j,dispose(i,number(m,a,b,c,d),number(n,a,b,c,d)),dispose(k,number(o,a,b,c,d),number(p,a,b,c,d)));
if (0 != result1[1]) {
if (result1[0] % result1[1] == 0) {
if (result1[0] / result1[1] == 24) {
if ((!map.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println("((" + printNumber(m) + printSymbol(i) + printNumber(n) + ")" + printSymbol(j) + printNumber(o) + ")" + printSymbol(k) + printNumber(p));
}
}
}
}
if (0 != result2[1]) {
if (result2[0] % result2[1] == 0) {
if (result2[0] / result2[1] == 24) {
if ((!map.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println("(" + printNumber(m) + printSymbol(i) +"(" + printNumber(n) + printSymbol(j) + printNumber(o) + "))" + printSymbol(k) + printNumber(p));
}
}
}
}
if (0 != result3[1]) {
if (result3[0] % result3[1] == 0) {
if (result3[0] / result3[1] == 24) {
if ((!map.containsKey(new Integer(i))) || (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println(printNumber(m) + printSymbol(i) +"(" + printNumber(n) + printSymbol(j) + "(" + printNumber(o) + printSymbol(k) + printNumber(p) + "))");
}
}
}
}
if (0 != result4[1]) {
if (result4[0] % result4[1] == 0) {
if (result4[0] / result4[1] == 24) {
if ((!map
.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println(printNumber(m) + printSymbol(i) +"((" + printNumber(n) + printSymbol(j) + printNumber(o) + ")" + printSymbol(k) + printNumber(p) + ")");
}
}
}
}
if (0 != result5[1]) {
if (result5[0] % result5[1] == 0) {
if (result5[0] / result5[1] == 24) {
if ((!map.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println("(" + printNumber(m) + printSymbol(i) + printNumber(n) + ")" + printSymbol(j) + "(" + printNumber(o) + printSymbol(k) + printNumber(p) + ")");
}
}
}
}
}
}
}
}
}
}
}
//总共几种答案，过滤了类似的答案
System.out.println("count: " + count);
}
public int printNumber(int i){
if(i == 0){
return aArray[0];
}
if(i == 1){
return bArray[0];
}
if(i == 2){
return cArray[0];
}
if(i == 3){
return dArray[0];
}
return 0;
}
public String printSymbol(int i){
if(i == 0){
return " + ";
}
if(i == 1){
return " - ";
}
if(i == 2){
return " * ";
}
if(i == 3){
return " / ";
}
return "";
}
}
package com.chanson;
/*
* @date Aug 3, 2006
* @project 学习
* @company 个人
* @author chanson
* @version 1.0
*/
import java.util.HashMap;
public class TwentyFour {
private int[] aArray = new int[2];
private int[] bArray = new int[2];
private int[] cArray = new int[2];
private int[] dArray = new int[2];
/**
* main方法
*
* @param args
*/
public static void main(String[] args) {
new TwentyFour().dispose(3, 4, 5, 8);
}
public void dispose(int a, int b, int c, int d){
aArray[0] = a;
aArray[1] = 1;
bArray[0] = b;
bArray[1] = 1;
cArray[0] = c;
cArray[1] = 1;
dArray[0] = d;
dArray[1] = 1;
core(aArray, bArray, cArray, dArray);
}
/**
* 加
*/
public int[] plus(int[] a, int[] b){
if(0 == a[1]){
return new int[]{0,0};
}
if(0 == b[1]){
return new int[]{0,0};
}
int denominator = leaseCommonMultiple(a[1],b[1]);
return new int[]{denominator/a[1]*a[0] + denominator/b[1]*b[0] ,denominator};
}
/**
* 减
* @param a
* @param b
* @return
*/
public int[] reduce(int[] a, int[] b){
if(0 == a[1]){
return new int[]{0,0};
}
if(0 == b[1]){
return new int[]{0,0};
}
int denominator = leaseCommonMultiple(a[1],b[1]);
return new int[]{denominator/a[1]*a[0] - denominator/b[1]*b[0] ,denominator};
}
/**
* 乘
* @param a
* @param b
* @return
*/
public int[] multiply(int[] a, int[] b){
return new int[]{a[0] * b[0], a[1] * b[1]};
}
/**
* 除
* @param a
* @param b
* @return
*/
public int[] divide(int[] a, int[] b){
return new int[]{a[0] * b[1], a[1] * b[0]};
}
/**
* 求最小公倍数
* @param a
* @param b
* @return
*/
public int leaseCommonMultiple(int a, int b){
return a*b/greatestCommonDivisor(a,b);
}
/**
* 求最大公约数
* @param a
* @param b
* @return
*/
public int greatestCommonDivisor(int a, int b) {
if(0 == a && 0 == b){
return 1;
}
if (0 == a) {
return b;
}
if (0 == b) {
return a;
}
if (a > b) {
int c = a;
a = b;
b = c;
}
for (int c = a % b; c > 0; c = a % b) {
a = b;
b = c;
}
return b;
}
/**
* 动态加载符号数
* @param i
* @param a
* @param b
* @return
*/
public int[] dispose(int i, int a[], int[] b){
if(i == 0){
return plus(a, b);
}else if(i == 1){
return reduce(a, b);
}else if(i == 2){
return multiply(a, b);
}else{
return divide(a, b);
}
}
/**
* 动态加载计算数
* @param i
* @param a
* @param b
* @param c
* @param d
* @return
*/
public int[] number(int i, int[] a, int[] b, int[] c, int[] d){
if(i == 0){
return a;
}else if(i == 1){
return b;
}else if(i == 2){
return c;
}else if(i == 3){
return d;
}else{
return new int[]{0,1};
}
}
/**
* 核心算法部分
* @param a
* @param b
* @param c
* @param d
*/
private void core(int[] a, int[] b, int[] c, int[] d) {
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
int count = 0;
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++){
for(int k = 0; k < 4; k++){
for(int m = 0; m < 4; m++){
for(int n = 0; n < 4; n++){
if(n == m)
continue;
for(int o = 0; o < 4; o++){
if(o == m || o == n)
continue;
for(int p = 0; p < 4; p++){
if(p == m || p == n || p == o)
continue;
//类型1：A(A(A(a,b),c),d)
int[] result1 = dispose(k,dispose(j,dispose(i,number(m,a,b,c,d),number(n,a,b,c,d)),number(o,a,b,c,d)),number(p,a,b,c,d));
//类型2：A(A(a,A(b,c)),d)
int[] result2 = dispose(k,dispose(i,number(m,a,b,c,d),dispose(j,number(n,a,b,c,d),number(o,a,b,c,d))),number(p,a,b,c,d));
//类型3：A(a,A(b,A(c,d)))
int[] result3 = dispose(i,number(m,a,b,c,d),dispose(j,number(n,a,b,c,d),dispose(k,number(o,a,b,c,d),number(p,a,b,c,d))));
//类型4：A(a,A(A(b,c),d))
int[] result4 = dispose(i,number(m,a,b,c,d),dispose(k,dispose(j,number(n,a,b,c,d),number(o,a,b,c,d)),number(p,a,b,c,d)));
//类型5：A(A(a,b),A(c,d))
int[] result5 = dispose(j,dispose(i,number(m,a,b,c,d),number(n,a,b,c,d)),dispose(k,number(o,a,b,c,d),number(p,a,b,c,d)));
if (0 != result1[1]) {
if (result1[0] % result1[1] == 0) {
if (result1[0] / result1[1] == 24) {
if ((!map.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println("((" + printNumber(m) + printSymbol(i) + printNumber(n) + ")" + printSymbol(j) + printNumber(o) + ")" + printSymbol(k) + printNumber(p));
}
}
}
}
if (0 != result2[1]) {
if (result2[0] % result2[1] == 0) {
if (result2[0] / result2[1] == 24) {
if ((!map.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println("(" + printNumber(m) + printSymbol(i) +"(" + printNumber(n) + printSymbol(j) + printNumber(o) + "))" + printSymbol(k) + printNumber(p));
}
}
}
}
if (0 != result3[1]) {
if (result3[0] % result3[1] == 0) {
if (result3[0] / result3[1] == 24) {
if ((!map.containsKey(new Integer(i))) || (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println(printNumber(m) + printSymbol(i) +"(" + printNumber(n) + printSymbol(j) + "(" + printNumber(o) + printSymbol(k) + printNumber(p) + "))");
}
}
}
}
if (0 != result4[1]) {
if (result4[0] % result4[1] == 0) {
if (result4[0] / result4[1] == 24) {
if ((!map
.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println(printNumber(m) + printSymbol(i) +"((" + printNumber(n) + printSymbol(j) + printNumber(o) + ")" + printSymbol(k) + printNumber(p) + ")");
}
}
}
}
if (0 != result5[1]) {
if (result5[0] % result5[1] == 0) {
if (result5[0] / result5[1] == 24) {
if ((!map.containsKey(new Integer(i)))|| (!map.containsKey(new Integer(j)))|| (!map.containsKey(new Integer(k)))) {
map.put(new Integer(i),new Integer(i));
map.put(new Integer(j),new Integer(j));
map.put(new Integer(k),new Integer(k));
count += 1;
System.out.println("(" + printNumber(m) + printSymbol(i) + printNumber(n) + ")" + printSymbol(j) + "(" + printNumber(o) + printSymbol(k) + printNumber(p) + ")");
}
}
}
}
}
}
}
}
}
}
}
//总共几种答案，过滤了类似的答案
System.out.println("count: " + count);
}
public int printNumber(int i){
if(i == 0){
return aArray[0];
}
if(i == 1){
return bArray[0];
}
if(i == 2){
return cArray[0];
}
if(i == 3){
return dArray[0];
}
return 0;
}
public String printSymbol(int i){
if(i == 0){
return " + ";
}
if(i == 1){
return " - ";
}
if(i == 2){
return " * ";
}
if(i == 3){
return " / ";
}
return "";
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- PAT 2-08 用扑克牌计算24点（C语言实现）
- Java实现的计算最大下标距离算法示例
- 【LeetCode-面试算法经典-Java实现】【151-Evaluate Reverse Polish Notation（计算逆波兰式）】
- knn算法计算位置电影的类型Java实现《机器学习实战》2.1节的例子
- PAT 2-08 用扑克牌计算24点（C语言实现）
- 余弦方法计算相似度算法--Python实现 Java实现
- Java基于余弦方法实现的计算相似度算法示例
- java实现编辑距离算法，计算字符串相似度
- 查找""排序""简单数学计算" "简单算法"[Java实现]（数据结构和算法）（复习）（持续更新
- 24点算法详解--Java代码实现
- java 24点算法实现
- Java文件Hash类,实现对计算进度的监视以及多算法的同时计算
- 【LeetCode-面试算法经典-Java实现】【150-Evaluate Reverse Polish Notation（计算逆波兰式）】
- 解析扑克牌游戏发牌算法——java实现
- 【算法数据结构Java实现】递归的简单剖析及时间复杂度计算
- 24点扑克牌游戏——（含java源码）（GUI实现）
- java实现24点算法
- java实现莱文斯坦算法（计算相似度）
- 扑克牌 洗牌算法 的java实现
- 扑克牌24点游戏JAVA实现