黑马程序员技术交流社区

标题: JAVA TreeSet添加对象有问题 [打印本页]
作者: hzhzhen    时间: 2015-5-23 10:54
标题: JAVA TreeSet添加对象有问题
  1. import java.util.ArrayList;
  2. import java.util.Comparator;
  3. import java.util.Iterator;
  4. import java.util.Random;
  5. import java.util.TreeSet;

  7. public class px {
  8. Random rd;
  9. TreeSet ts;
  10. TreeSet ts1;
  11. TreeSet ts2;
  12. TreeSet ts3;
  13. TreeSet ts4;
  14. px(){
  15.   rd=new Random();
  16.   //ts=new TreeSet();
  17.   
  18.   ts=new TreeSet(new Comparator(){

  20.    public int compare(Object o1, Object o2) {
  21.     player p1=(player)o1;
  22.     player p2=(player)o2;
  23.     return p1.whole<p2.whole?1:p1.whole<p2.whole?-1:0;
  24.    }
  25.    
  26.   });
  27.   
  28.   ts1=new TreeSet(new Comparator(){

  30.    public int compare(Object o1, Object o2) {
  31.     player p1=(player)o1;
  32.     player p2=(player)o2;
  33.     return p1.money<p2.money?1:p1.money<p2.money?-1:0;
  34.    }
  35.    
  36.   });
  37.   
  38.   ts2=new TreeSet(new Comparator(){

  40.    public int compare(Object o1, Object o2) {
  41.     player p1=(player)o1;
  42.     player p2=(player)o2;
  43.     return p1.wood<p2.wood?1:p1.wood<p2.wood?-1:0;
  44.    }
  45.    
  46.   });
  47.   
  48.   ts3=new TreeSet(new Comparator(){

  50.    public int compare(Object o1, Object o2) {
  51.     player p1=(player)o1;
  52.     player p2=(player)o2;
  53.     return p1.sin<p2.sin?1:p1.sin<p2.sin?-1:0;
  54.    }
  55.    
  56.   });
  57.   
  58.   ts4=new TreeSet(new Comparator(){

  60.    public int compare(Object o1, Object o2) {
  61.     player p1=(player)o1;
  62.     player p2=(player)o2;
  63.     return p1.death<p2.death?1:p1.death<p2.death?-1:0;
  64.    }
  65.    
  66.   });
  67. }

  69. public void generate(){
  70.   for(int i=0;i<5;i++){
  71.    player p=new player(rd.nextInt(100),rd.nextInt(100),rd.nextInt(100),rd.nextInt(100));
  72.    add(p);
  73.   }
  74. }
  75. public void add(player p){
  76.   ts.add(p);
  77.   ts1.add(p);
  78.   ts2.add(p);
  79.   ts3.add(p);
  80.   ts4.add(p);
  81. }
  82. public void show(TreeSet ts){
  83.   System.out.println(ts.size());
  84.   Iterator it=ts.iterator();
  85.   while(it.hasNext()){
  86.    ((player)it.next()).show();
  87.   }
  88.   System.out.println();
  89. }
  90. public static void main(String[] args) {
  91.   px p=new px();
  92.   p.generate();
  93.   p.show(p.ts);
  94. }
  95. }
  96. class player/* implements Comparator*/{
  97. int money;
  98. int wood;
  99. int sin;
  100. int death;
  101. int whole;
  102. player(int money,int wood,int sin,int death){
  103.   this.money=money;
  104.   this.wood=wood;
  105.   this.sin=sin;
  106.   this.death=death;
  107.   whole=money+wood+sin+death;
  108. }
  109. public void show(){
  110.   System.out.print("金币:"+money+'\t');
  111.   System.out.print("木材:"+wood+'\t');
  112.   System.out.print("罪恶值:"+sin+'\t');
  113.   System.out.print("死亡数:"+death+'\t');
  114.   System.out.println("总分:"+whole);
  115. }
  116. /*public int compare(Object o1, Object o2) {
  117.   player p1=(player)o1;
  118.   player p2=(player)o2;
  119.   return p1.whole<p2.whole?1:p1.whole<p2.whole?-1:0;
  120. }*/
  121. }
复制代码
作者: pvbj0314    时间: 2015-5-23 22:06
比较规则有问题把“ p1.whole<p2.whole?1:p1.whole<p2.whole?-1:0;”中的第二个“<”改为>。类似的都修改。下面是我改过的，5个Player都有，你试试：
  1. import java.util.ArrayList;
  2. import java.util.Comparator;
  3. import java.util.Iterator;
  4. import java.util.Random;
  5. import java.util.TreeSet;

  7. public class PX {
  8.     Random rd;
  9.     TreeSet ts;
  10.     TreeSet ts1;
  11.     TreeSet ts2;
  12.     TreeSet ts3;
  13.     TreeSet ts4;
  14.     PX(){
  15.          rd=new Random();
  16.          //ts=new TreeSet();
  17.          
  18.          ts=new TreeSet(new Comparator(){
  19.               public int compare(Object o1, Object o2) {
  20.                    player p1=(player)o1;
  21.                    player p2=(player)o2;
  22.                    return p1.whole<p2.whole?1:p1.whole>p2.whole?-1:0;
  23.               }
  24.          });
  25.          ts1=new TreeSet(new Comparator(){
  26.               public int compare(Object o1, Object o2) {
  27.                    player p1=(player)o1;
  28.                    player p2=(player)o2;
  29.                    return p1.money<p2.money?1:p1.money>p2.money?-1:0;
  30.               }
  31.          });
  32.          ts2=new TreeSet(new Comparator(){
  33.               public int compare(Object o1, Object o2) {
  34.                    player p1=(player)o1;
  35.                    player p2=(player)o2;
  36.                    return p1.wood<p2.wood?1:p1.wood>p2.wood?-1:0;
  37.               }
  38.          });
  39.          ts3=new TreeSet(new Comparator(){
  40.               public int compare(Object o1, Object o2) {
  41.                    player p1=(player)o1;
  42.                    player p2=(player)o2;
  43.                    return p1.sin<p2.sin?1:p1.sin>p2.sin?-1:0;
  44.               }
  45.          });
  46.          ts4=new TreeSet(new Comparator(){
  47.               public int compare(Object o1, Object o2) {
  48.                    player p1=(player)o1;
  49.                    player p2=(player)o2;
  50.                    return p1.death<p2.death?1:p1.death>p2.death?-1:0;
  51.               }
  52.          });
  53.     }
  54.     public void generate(){
  55.          for(int i=0;i<5;i++){
  56.               player p=new player(rd.nextInt(100),rd.nextInt(100),rd.nextInt(100),rd.nextInt(100));
  57.               add(p);
  58.          }
  59.     }
  60.     public void add(player p){
  61.          ts.add(p);
  62.          ts1.add(p);
  63.          ts2.add(p);
  64.          ts3.add(p);
  65.          ts4.add(p);
  66.     }
  67.     public void show(TreeSet ts){
  68.          System.out.println(ts.size());
  69.          Iterator it=ts.iterator();
  70.          while(it.hasNext()){
  71.               ((player)it.next()).show();
  72.          }
  73.          System.out.println();
  74.     }
  75.     public static void main(String[] args) {
  76.          PX p=new PX();
  77.          p.generate();
  78.          p.show(p.ts);
  79.          p.show(p.ts1);
  80.          p.show(p.ts2);
  81.          p.show(p.ts3);
  82.          p.show(p.ts4);
  83.     }
  84. }
  85. class player/* implements Comparator*/{
  86.      int money;
  87.      int wood;
  88.      int sin;
  89.      int death;
  90.      int whole;
  91.      player(int money,int wood,int sin,int death){
  92.           this.money=money;
  93.           this.wood=wood;
  94.           this.sin=sin;
  95.           this.death=death;
  96.           whole=money+wood+sin+death;
  97.      }
  98.      public void show(){
  99.           System.out.print("金币:"+money+'\t');
  100.           System.out.print("木材:"+wood+'\t');
  101.           System.out.print("罪恶值:"+sin+'\t');
  102.           System.out.print("死亡数:"+death+'\t');
  103.           System.out.println("总分:"+whole);
  104.      }
  105. /*public int compare(Object o1, Object o2) {
  106.   player p1=(player)o1;
  107.   player p2=(player)o2;
  108.   return p1.whole<p2.whole?1:p1.whole<p2.whole?-1:0;
  109. }*/
  110. }
复制代码







欢迎光临 黑马程序员技术交流社区 (http://bbs.itheima.com/) 黑马程序员IT技术论坛 X3.2