这道题来源于一下这张图:会长在群里贴了这么一张图。
本来就是图个乐呵,然后一群无聊的人讨论这怎么解,再后来把题目强化了一下,变成了一道完全切合魔兽世界的题目。题目如下:
WOW里共有11个职业,分别是ZS、QS、DK、D、SM、MS、FS、SS、DZ、LR、WS,其中5个职业能坦克(拥有T天赋),5个职业能奶(拥有N天赋),11个职业都可以输出(拥有DPS天赋)。其中ZS、DK能T能DPS;QS、D、WS能T能N能DPS;SM、MS能N能DPS;FS、DZ、LR、SS只能DPS。现将组成个5人队,队伍里要有1T、1N、3DPS,问:共有几种职业组合?
注:1.对不玩WOW的说的话:以上职业为缩写,不认识的话就当变量缩写了;
2.对WOWer说的话,请默认同一职业同时拥有多天赋,不需要切天赋。
这是一道数学问题,所以不在这里做数学解答,数学解答我有空的话就在别的地方写了,这里写下如何用代码解决这个问题。
1.创建一个职业接口,用于确定职业
public interface Classes {
public int getIndex();
}
2.枚举Tank、Healer和DPS分别实现Classes接口
public enum Tank implements Classes {
ZS(1), DK(3), QS(2), D(4), WS(11);
Tank(int index) {
this.index = index;
}
private int index;
public int getIndex() {
return index;
}
}
public enum Healer implements Classes {
QS(2), D(4), WS(11), SM(5), MS(6);
Healer(int index) {
this.index = index;
}
private int index;
public int getIndex() {
return index;
}
}
public enum DPS implements Classes{
ZS(1), QS(2), DK(3), D(4), WS(11), SM(5), MS(6), FS(7), SS(8), DZ(9), LR(10);
DPS(int index) {
this.index = index;
}
private int index;
public int getIndex() {
return index;
}
}
3.Player类实现Comparable接口,用于排序
public class Player implements Comparable<Player> {
private Classes classes;
public Player(Classes classes) {
this.classes = classes;
}
public int getIndex() {
return classes.getIndex();
}
public void setClasses(Classes classes) {
this.classes = classes;
}
@Override
public int compareTo(Player o) {
if (this.getIndex() < o.getIndex()) {
return -1;
} else if (this.getIndex() > o.getIndex()) {
return 1;
}
return 0;
}
}
4.Party类实现Comparable接口,用于排序
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class Party implements Comparable<Party> {
List<Player> players = new ArrayList<Player>();
public void addPlayer(Player p) {
players.add(p);
Collections.sort(players);
}
@Override
public int compareTo(Party o) {
for (int i = 0; i < 5; i++) {
if (players.get(i).getIndex() < o.players.get(i).getIndex()) {
return -1;
} else if (players.get(i).getIndex() > o.players.get(i).getIndex()) {
return 1;
}
}
return 0;
}
}
主要部分完成,下面将进行计算
public class test1 {
public static void main(String[] args) {
Set<Party> parties = new TreeSet<>();
int cnt = 0;
for (Classes c1 : Tank.values()) {
for (Classes c2 : Healer.values()) {
for (Classes c3 : DPS.values()) {
for (Classes c4 : DPS.values()) {
for (Classes c5 : DPS.values()) {
Player p1 = new Player(c1);
Player p2 = new Player(c2);
Player p3 = new Player(c3);
Player p4 = new Player(c4);
Player p5 = new Player(c5);
Party party = new Party();
party.addPlayer(p1);
party.addPlayer(p2);
party.addPlayer(p3);
party.addPlayer(p4);
party.addPlayer(p5);
if (!parties.contains(party)) {
parties.add(party);
cnt++;
}
}
}
}
}
}
System.out.println(cnt);
}
}
最终输出结果为2450。
实在是论文写的太烦了,弄个娱乐一下。
数学解法发在我的空间里了。