辅导FIFO数据结构、辅导JAVA FIFO程序、讲解java FIFO
辅导留学生Prolog|辅导Database
package proj;
public class FIFO {
private int size;
private String[] memory1;
private String address;
private int count = 0;
public FIFO(int size) {
this.size = size;
memory1 = new String[size];
}
public void addFIFO(String address) {
this.address = address;
String[] memory_ = new String[size];
if(contains(address)) {
return;
} else {
count++;
memory_[0] = address;
for(int i=0;imemory_[i+1] = memory1[i];
}
memory1 = memory_;
}
//for(int i=0;i//if(memory1[i]==null){
//String st="0";
//memory1[i]=st;
//}
//}
}
private boolean contains(String address) {
for(int i=0;iif(address.equals(memory1[i]))
return true;
}
return false;
}
public String toString() {
String str = ""+address+""+"：";
for(int i=0;istr = str +"|"+ memory1[i];
}
return str+"|";
}
public int interrupt() {
return count;
}
- QQ：99515681
- 邮箱：99515681@qq.com
- 工作时间：8:00-21:00
- 微信：codinghelp
联系我们 - QQ: 99515681 微信：codinghelp
程序辅导网！