用java实现动态分区问题,运用链表的知识,实现分配和回收,这个问题在回收过程中需要考虑8种情况,并按照相应的情况决定是否对空闲分区进行合并。
package 动态分区;
public class Area {
private int number;
private String name;
private int startaddress;
private int size1;
private int flag;
public Area(){};
public Area(String name,int size1,int startaddress,int flag){
this.name = name;
this.size1 = size1;
this.startaddress = startaddress;
this.flag = flag;
}
public Area(String name,int size1)
{
this.name = name;
this.size1 = size1;
}
public void setName(String name)
{
this.name = name;
}
public String getName(){
return name;
}
public void setSize(int size1)
{
this.size1 = size1;
}
public int getSize()
{
return size1;
}
public void setFlag(int flag)
{
this.flag = flag;
}
public int getFlag()
{
return flag;
}
public void setStartaddress(int startaddress)
{
this.startaddress = startaddress;
}
public int getStartaddress()
{
return startaddress;
}
}
package 动态分区;