本文实例讲述了java实现的海盗算法。分享给大家供大家参考,具体如下:
前面介绍了《c#实现的海盗分金算法》,这里再给出一个java优化版的算法:
package unit4;
public class pirate{
private string name;
private int[] schemes;
private int index;
public pirate(int t,int i) {
name="unknow";
index=i;
schemes=makeschemes(t);
}
public string getname() {
return name;
}
public void setname(string name) {
this.name = name;
}
public int getindex(){return index;}
public int[] getschemes() {return schemes;}
public int handvote(int table[]) {
return myhandvote(table,index);
}
private int myhandvote(int []t,int i) {
if(t[i]==0) return 0;
if(i==1) return 0;
return 1;
}
public int[] makeschemes(int t) {
int vote=0;
schemes =new int[t-index];
do{
for(int i=0;i
schemes[i]=(i+1)%2;
}
for(int i=0;i
vote=vote+myhandvote(schemes,i);
}
}while(!(2*vote>t/2));
return schemes;
}
}
package unit4;
public class judger {
int[] allot;
pirate[] pirates;
public judger(pirate []pirates,int[]a) {
this.pirates=pirates;
allot=a;
}
public int[] getallot() {
return allot;
}
public void setallot(int[] allot) {
this.allot = allot;
}
public pirate[] getpirates() {
return pirates;
}
public void setpirates(pirate[] pirates) {
this.pirates = pirates;
}
public boolean evaluate(){
int vote=0;
for(int i=0;i
vote+=pirates[i].handvote(allot);
}
if(2*vote>=pirates.length) return true;
else return false;
}
}
package unit4;
public class maxinterest {
public static void main(string[] args) {
int piratecounts=5;
pirate[]pirates=new pirate[piratecounts];
for(int i=0;i
pirates[i]=new pirate(piratecounts,i);
pirates[i].setname("name"+i);
}
int[]table =pirates[0].getschemes();
judger ajudge=new judger(pirates,table);
if(ajudge.evaluate()){
int[]scheme=ajudge.getallot();
for(int i=0;i
}
}
}
希望本文所述对大家java程序设计有所帮助。
希望与广大网友互动??
点此进行留言吧!