http://www.javaeye.com/topic/88204

1. package com.maodajun.javaeye1;
3. import java.util.ArrayList;
4. import java.util.Iterator;
5. import java.util.List;
7. public class BaiDuQuest {
9. public String teamAndImpossable(int peoples,int impossable){
10. int maximpossable= maxImpossable(peoples);
11. maximpossable -=impossable;
12. List list =selfTeam(peoples,maximpossable,new ArrayList());
13. if(list!=null){
14. return "YES";
15. }
16. return "NO";
17. }
18. //递归算出最大可能。。。循环赛制
19. public int maxImpossable(int poples){
21. if(poples==2){
22. return 1;
23. }else if(poples<1){
24. return 0;
25. }
26. poples--;
27. return maxImpossable(poples)+poples;
28. }
30. public int maxFirstTeam(int peoples, int maximpossable){
31. int tmp = 0 ;
32. if(maxImpossable(peoples)
33. return -1;
34. }
35. for(int i = peoples ; i >1 ; i--){
36. tmp = maxImpossable(i);
37. if(tmp <= maximpossable){
38. return i;
39. }
40. }
41. return tmp;
42. }
43. public List selfTeam(int peoples , int maximpossable ,List list ){
44. int max = maxFirstTeam(peoples,maximpossable);
45. if(max==0){
46. return list;
47. }else if (max==-1){
48. return null;
49. }else{
50. list .add(""+max);
51. return selfTeam(peoples-max,maximpossable-maxImpossable(max),list);
52. }
53. }
54. public static void main(String[] arg){
55. BaiDuQuest quest = new BaiDuQuest();
56. int people = 5;
57. for(int i = quest.maxImpossable(people) ; i >=0; i--){
58. List list =quest.selfTeam(people,i,new ArrayList());
59. int count = 0 ;
60. if(list!=null){
61. for(int j = 0 ; j < list.size(); j ++){
62. count +=Integer.parseInt(list.get(j).toString());
64. }
66. list.add(""+(people-count));
67. }
68. System.out.println(quest.maxImpossable(people)-i+":"+list);
69. }
70. }
74. }