24点游戏动态规划解法(java)

最新推荐文章于 2021-09-11 17:30:16 发布

原创

最新推荐文章于 2021-09-11 17:30:16 发布 · 2.5k 阅读

2 ·

CC 4.0 BY-SA版权

本文介绍了24点游戏的动态规划解决方案，详细阐述了算法原理，并提供了Java实现代码，通过子问题S[i] U= Fork(f(x),f(i-x))来求解。" 122313377,7335873,PMBOK第六版中文详解,"['项目管理', 'PMBOK指南', '管理框架']

算法原理参考编程之美1.16章节解法2：

下面是java源码：子问题为S[i] U= Fork(f(x),f(i-x));


import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

class Elem{
	public double res;
	public String info;
	public Elem(double r,String i){
		res = r;
		info = i;
	}
}
public class CalculateAnswer {
	
	private final int N = 4;
	private final int res = 24;
	private int[] A;
	private Map<Integer, Set<Elem>> map;
	private Set<String> answers;
	
	public CalculateAnswer(int[] a) {
		A = a;
		map = new HashMap<Integer, Set<Elem>>();
		answers = new HashSet<String>();

	}
	public void run() {
		for(int i=0;i<(1<<N);i++) {
			Set<Elem> set = new HashSet<Elem>();
			map.put(i,set);
		}
		for(int i=0;i<N;i++){
			Elem e = new Elem(A[i], A[i]+"");
			Set<Elem> set = new HashSet<Elem>();
			set.add(e);
			map.put(1<<i, set);
		}