小编典典
这个过程非常简单：首先从一组多米诺骨牌D和一条空链C开始。
for each domino in the collection:
see if it can be added to the chain (either the chain is empty, or the first
number is the same as the second number of the last domino in the chain.
if it can,
append the domino to the chain,
then print this new chain as it is a solution,
then call recursively with D - {domino} and C + {domino}
repeat with the flipped domino
Java代码：
public class Domino {
public final int a;
public final int b;
public Domino(int a, int b) {
this.a = a;
this.b = b;
}
public Domino flipped() {
return new Domino(b, a);
}
@Override
public String toString() {
return "[" + a + "/" + b + "]";
}
}
算法：
private static void listChains(List chain, List list) {
for (int i = 0; i < list.size(); ++i) {
Domino dom = list.get(i);
if (canAppend(dom, chain)) {
chain.add(dom);
System.out.println(chain);
Domino saved = list.remove(i);
listChains(chain, list);
list.add(i, saved);
chain.remove(chain.size()-1);
}
dom = dom.flipped();
if (canAppend(dom, chain)) {
chain.add(dom);
System.out.println(chain);
Domino saved = list.remove(i);
listChains(chain, list);
list.add(i, saved);
chain.remove(chain.size()-1);
}
}
}
private static boolean canAppend(Domino dom, List to) {
return to.isEmpty() || to.get(to.size()-1).b == dom.a;
}
你的例子：
public static void main(String... args) {
List list = new ArrayList<>();
// [3/4] [5/6] [1/4] [1/6]
list.add(new Domino(3, 4));
list.add(new Domino(5, 6));
list.add(new Domino(1, 4));
list.add(new Domino(1, 6));
List chain = new ArrayList<>();
listChains(chain, list);
}
-07-28
如果觉得《多米诺骨牌java_通过递归和回溯找到所有可能的多米诺骨牌链》对你有帮助，请点赞、收藏，并留下你的观点哦！
