Re: [問題] PriorityQueue排出來的結果不對

看板java作者olys (查無暱稱)時間13年前 (2012/03/15 12:40)推噓3(3推 0噓 6→)

留言9則, 4人參與討論串3/3 (看更多)

因為推文我放上code

推

03/15 10:35,

03/15 10:35

這是Comparator宣告 public static class NNQECompare implements Comparator<NNQE>{ public int compare(NNQE N1, NNQE N2){ if(N1.distance>N2.distance) return 1; if(N1.distance<N2.distance) return -1; return 0; } } 這是使用的地方 Priority.clear(); for(DataCache curB: Cache){ if(curB.ObjectCount != 0){ for(int j = 0; j < curB.ObjectCount ; j++){ t = new SpaceObject(curB.Items[j].x,curB.Items[j].y,curB.Items[j].id); discompute=DisComputing(QItem, t); if(discompute > RegionRadius) continue; else Priority.add(new NNQE(t, discompute)); } } } 以下是NNQE的class public class NNQE { public double distance; public SpaceObject element; public NNQElement(SpaceObject O, double d) { element = O; distance = d; } public double getdis(){ return distance; } } -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.117.177.98 ※ 編輯: olys 來自: 140.117.177.98 (03/15 12:49)

→

olys

03/15 13:36, , 1^F

03/15 13:36, 1^F

推

LaPass

03/15 13:45, , 2^F

03/15 13:45, 2^F

→

olys

03/15 13:47, , 3^F

03/15 13:47, 3^F