可变分区首次适应算法(Java版)

1、运行平台：MyEclipse使用方法：新建一个Distribution1类，粘贴代码即可packagemypackage;importjavax.swing.JOptionPane;publicclassDistribution1voidInput()voidOutput()Suggestion=|+分区号+|+分区大小+|+起始地址+|for(intk=0;k=j;k+)Suggestion+=n|+k+|;Suggestion+=partk+|;Suggestion+=addressk+|;Suggestion+=flagk+|;+状态+|;Suggestion=JOptionPane.s

2、howInputDialog(请输入可分配内存的大小：);size=Integer.parseInt(Suggestion);intsize=0;publicintj;/用于记录内存分块数intpart=newint1000;/用于记录内存分块的大小intaddress=newint1000;/用于记录内存分块的起始地址intflag=newint1000;/用于记录内存分块的分配情况StringSuggestion;for(inti=0;i1000;i+)parti=0;addressi=0;flagi=0;Distribution1()/endDistribution1()/endInpu

3、t()JOptionPane.showMessageDialog(null,Suggestion内存分酉己情况,JOptionPane.INFORMATION_MESSAGE);/endOutput()voidBegin()chars=y;inti=0;intcount=0;Suggestion=JOptionPane.showInputDialog(请输入内存的起始地址：);addressi=Integer.parseInt(Suggestion);，己录首地址Suggestion=JOptionPane.showInputDialog(请输入第0块分区的大小:);parti=Integer

4、.parseInt(Suggestion);/记录第0块分区的大小count=parti;flagi=1;i+;j+;Suggestion=JOptionPane.showInputDialog(是否继续分块，是请输入y或Y,s=Suggestion.charAt(0);while(s=y|s=Y)Suggestion=JOptionPane.showInputDialog(胄输入第+i+”块分区的大小parti=Integer.parseInt(Suggestion);if(size-countparti)elseSuggestion=JOptionPane.showInputDialog(

5、b否继续，是请输入y或Y,s=Suggestion.charAt(0);addressi=addressi-1+parti-1;flagi=1;count=count+parti;i+;j+;JOptionPane.showMessageDialog(null,剩余空间不足以分配！);否请输入任意字符：););否则请输入任意的字符：);/while(s=y|s=Y)parti=size-count;addressi=addressi-1+parti-1;flagi=0;/endBegin()voidRestore()可作改进，在Suggestion中输入所有要回收的内存块，再将其解析出来。ch

6、ars;inti;intk=0;intcount=0;inttag=0;intnumber=0,1,2,3,4,5,6,7,8,9;Suggestion=JOptionPane.showInputDialog(是否要回收内存，是请输入y或Y,否请输入任意的字符：);s=Suggestion.charAt(0);if(s=y|s=Y)Suggestion=JOptionPane.showInputDialog(请输入要回收的内存块号，for(i=0;iSuggestion.length();i+)if(Suggestion.charAt(i)!=)/for(k=0;kj)JOptionPane.

7、showMessageDialog(null,输入的内存号不存在，请重新输入!,Warning,JOptionPane.INFORMATION_MESSAGE);continue;elseflagtag=0;tag=0;/for/iffor(i=1；i=j；i+)/合并连续的空闲空间5/ 7(if(flagi-1=0&flagi=0)(parti-1=parti-1+parti;count+;for(k=i;k=j;k+)(partk=partk+1;addressk=addressk+1;/for/if/forfor(i=1;i=j;i+)/移动flag数组的元素(if(flagi-1=0&flagi=0)(for(k=i;k=j;k+)(flagk=flagk+1;/for/if/forj=j-count;/endRestore()publicstaticvoidmain(Stringarg)JOptionPane.showMessageDialog(null,ttttt可变分区首次适应算Distribution1distribute=newDistribution1();distribute.Input();distribute.Begin()