操作系统-磁盘调度算法:先来先服务,最短寻道时间优先,scan算法 (四)

/**
* 磁盘调度:scan算法
*/
private static int startPosition = 100 ;//磁头开始位置
private static int totalMoving = 0;
private static List visitList = new ArrayList();//访问磁道列表
private static int moveDirection = 0;//0:向外移动,1:向里移动
private static int size;
public static void main(String[] args) {
System.out.println("------磁盘调度:scan算法模拟---------");
input();
running();
display();
}

//接收用户输入列表
public static void input(){
System.out.print("请输入磁道访问列表,以空格分开:");
Scanner sc = new Scanner(System.in);
String input = sc.nextLine();
String[] inputList = input.split("\\s");
try{
for(String in : inputList){
visitList.add(Integer.valueOf(in));
}
size = visitList.size();
}
catch(Exception e){
System.out.println("输入的必须是数字,请重新开始！！！");
System.exit(1);
}
}

//运行
public static void running(){
int visitNumber = 0;
for(int i=0,size = visitList.size();i visitNumber = searchMinimum(startPosition);
System.out.println("当前访问磁道:"+visitNumber);
}
}
//寻找与当前磁头最近并且和磁头的移动方向一致的磁道号
public static int searchMinimum(int startPosition){
int min = Integer.MAX_VALUE,index = -1,i = 0,thisPosition = 0,computing=0;
Iterator it = visitList.iterator();
while(it.hasNext()){
int in = it.next();
computing = Math.abs(startPosition-in