OO的乒乓球练习 = =

问题来自： http://bbs.spoto.net/viewthread.php?tid=15658

引用chendabian发表于 2008-8-4 22:29:
【两个乒乓球队进行比赛】
两个乒乓球队进行比赛，各出三人。甲队A,B,C,已队x,y,z，A说他不和x比，C说他不和x,z 比，编程找出三队赛手的名单。 请问这道题 该怎么写？？？

毫无头绪的乱写……
大略流程是{
创建选手对象a,b,c,x,y,z;
a.不想比(x);c.不想比(z);
创建队伍对象甲,乙;
甲队.加入队员(a,b,c);
乙队.加入队员(x,y,z);
创建比赛列表playList=甲队.比赛与(乙队);
playList.打印();
}

其中创建比赛列表使用了匈牙利算法求最大二分图匹配。= =
因为我不会写全排列{给next_permulation养成的}，也不知道该用其他什么方法。

附：代码文件列表
TestGame 测试文件

1. import junit.framework.TestCase;
3. public class TestGame extends TestCase {
4.     
5.     public void testPlayer(){
6.         Player a = new Player("A");
7.         assertEquals("A",a.getName());
8.         
9.         Player x = new Player("X");
10.         assertTrue(a.playTo(x));
11.         a.dislikeTo(x);
12.         assertFalse(a.playTo(x));
13.     }
14.     
15.     public void testTeam(){
16.         Team first = new Team("甲");
17.         assertEquals("甲",first.getName());
18.         assertFalse(first.havePlayers());
19.         assertEquals(0,first.getPlayerCount());
20.         
21.         Player a = new Player("A");
22.         first.addPlayer(a);
23.         assertTrue(first.havePlayers());
24.         assertEquals(1,first.getPlayerCount());
25.         
26.         Player b = new Player("B");
27.         first.addPlayer(b);
28.         assertEquals(2,first.getPlayerCount());
29.     }
30.     
31.     public void testGame(){
32.         Team first = new Team("甲");
33.         Player a = new Player("A");
34.         first.addPlayer(a);
35.         Player b = new Player("B");
36.         first.addPlayer(b);
37.         Player c = new Player("C");
38.         first.addPlayer(c);
39.         
40.         Team second = new Team("乙");
41.         Player x = new Player("X");
42.         second.addPlayer(x);
43.         Player y = new Player("Y");
44.         second.addPlayer(y);
45.         Player z = new Player("Z");
46.         second.addPlayer(z);
47.         
48.         Player d = new Player("D");
49.         
50.         a.dislikeTo(x);
51.         c.dislikeTo(x);
52.         c.dislikeTo(z);
53.         PlayList playList = first.playTo(second);
54.         assertFalse(playList.searchGame(a,x));
55.         assertFalse(playList.searchGame(a,d));
56.         assertFalse(playList.searchGame(c,x));
57.         assertFalse(playList.searchGame(c,z));
58.         assertTrue(playList.searchGame(b,x));
59.         assertTrue(playList.searchGame(a,z));
60.         assertTrue(playList.searchGame(y,c));
61.     }
63. }

PingPongGame 入口

1. public class PingPongGame {
3.     /**
4.      * @author linyq.
5.      */
6.     public static void main(String[] args) {
7.         Team first = new Team("甲");
8.         Player a = new Player("A");
9.         first.addPlayer(a);
10.         Player b = new Player("B");
11.         first.addPlayer(b);
12.         Player c = new Player("C");
13.         first.addPlayer(c);
14.         
15.         Team second = new Team("乙");
16.         Player x = new Player("X");
17.         second.addPlayer(x);
18.         Player y = new Player("Y");
19.         second.addPlayer(y);
20.         Player z = new Player("Z");
21.         second.addPlayer(z);        
22.         
23.         a.dislikeTo(x);
24.         c.dislikeTo(x);
25.         c.dislikeTo(z);
26.         
27.         first.playTo(second).printList();           
28.         second.playTo(first).printList();
29.     }
31. }

Player 队员类

1. import java.util.ArrayList;
2. import java.util.List;
4. public class Player implements Comparable{
5.     
6.     private String playerName ;
7.     
8.     private List<Player> displayList = new ArrayList<Player>();
9.     
10.     public Player(){
11.     }
12.     
13.     public Player(String playerName){
14.         this.playerName = playerName;
15.     }
16.     
17.     public boolean playTo(Player player){
18.         if(this==player)
19.             return false;
20.         
21.         if(displayList.contains(player))
22.             return false;
23.         
24.         return true;
25.     }
27.     public String getName() {
28.         return this.playerName;
29.     }
31.     public void dislikeTo(Player player) {
32.         if(!displayList.contains(player)){
33.             displayList.add(player);
34.             player.dislikeTo(this);
35.         }
36.     }
38.     @Override
39.     public int compareTo(Object obj) {
40.         return playerName.compareTo(((Player) obj).getName());
41.     }
43. }

Team 队伍类

1. import java.util.ArrayList;
2. import java.util.List;
4. public class Team {
5.     
6.     private String teamName ;
7.     private List<Player> playerList = new ArrayList<Player>();
9.     public Team(){
10.     }
11.     
12.     public Team(String teamName){
13.         this.teamName = teamName;
14.     }
16.     public String getName() {
17.         return this.teamName;
18.     }
20.     public boolean havePlayers() {
21.         return !playerList.isEmpty();
22.     }
24.     public int getPlayerCount() {
25.         return playerList.size();
26.     }
28.     public void addPlayer(Player player) {
29.         playerList.add(player);
30.     }
32.     public PlayList playTo(Team team){      
33.         PlayList playList = new Hopcroft(this,team).getList();
34.         return playList;
35.     }
37.     public List<Player> getPlayList() {
38.         return this.playerList;
39.     }
40.     
41. }

PlayList 比赛名单类

1. import java.util.List;
2. import java.util.TreeMap;
4. public class PlayList extends TreeMap<Player,Player>{
5.     
6.     private Team first,second;
7.     
8.     public PlayList(Team first, Team second) {
9.         this.first = first;
10.         this.second = second;
11.     }
13.     public void printList() {
14.         System.out.println("【"+first.getName() + "对战"+ second.getName() + "名单公布】");
15.         for(Player player:first.getPlayList()){
16.             if(this.containsKey(player)){
17.                 System.out.println( player.getName() + " v.s " + this.get(player).getName());
18.             }
19.         }
20.     }
22.     public boolean searchGame(Player a, Player b) {
23.         if(this.get(a)==b||this.get(b)==a)
24.             return true;
25.         return false;
26.     }
28. }

Hopcroft 匈牙利算法类

1. public class Hopcroft {
2.     
3.     private int MAX = 5;
5.     private boolean[] used = new boolean[MAX];
6.     
7.     private int[] link = new int[MAX];
8.     
9.     private boolean[][] map = new boolean[MAX][MAX];
10.     
11.     private Team first,second;
12.     
13.     public Hopcroft(Team first,Team second){
14.         this.first = first;
15.         this.second = second;
16.     }
17.     
18.     public PlayList getList(){
19.         this.createMap();
20.         this.maxMatch();
21.         PlayList playList = this.getPlayList();     
22.         
23.         return playList;
24.     }
25.     
26.     private PlayList getPlayList() {
27.         PlayList playList = new PlayList(first,second);
28.         for(int i=0;i<second.getPlayList().size();i++){
29.             playList.put(first.getPlayList().get(link[i]), second.getPlayList().get(i));
30.         }
31.         return playList;
32.     }
34.     private void createMap(){
35.         int i=0;
36.         for(Player a: first.getPlayList()){
37.             int j=0;
38.             for(Player b: second.getPlayList()){
39.                 if(a.playTo(b)&&b.playTo(a))
40.                     map[i][j]=true;
41.                 else
42.                     map[i][j]=false;
43.                 j++;
44.             }
45.             i++;
46.         }
47.     }
48.     
49.     private boolean checkMap(int t){
50.         for(int i=0;i<second.getPlayerCount();i++)
51.             if(!used[i]&&map[t][i]){
52.                 used[i]=true;
53.                 if(link[i]==0||checkMap(link[i])){
54.                     link[i]=t;
55.                     return true;
56.                 }
57.             }
58.         return false;
59.     }
60.     
61.     private void maxMatch(){
62.         for(int i = first.getPlayerCount()-1 ; i>=0;i--){
63.             for(int j=0;j<second.getPlayerCount();j++)used[j]=false;
64.             checkMap(i);
65.         }
66.     }
67. }