操作系统-（动态高优先权优先算法）

package Blue;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/*
 * 本项目使用每进行一个时间当前执行的作业优先级减少n，其余的优先级不变
 */

//Wait——等待(堵塞),Run——运行,Finish——完成
public class 动态高优先权优先算法 {
	public static Job ans[];
	public static int time,num;
	public static int n;
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
			System.out.println("请输入有多少个作业：");
		num = input.nextInt();
		System.out.println("请输入每进行一个单位时间优先级减少多少：");
		n =input.nextInt();
		ans =new Job[num];
		System.out.println("请依次输入"+num+"个作业的作业名、到达时间、服务时间、优先级");
		for (int i = 0; i <num; i++) {
			String name = input.next();
			int arriveTime = input.nextInt();
			int serviceTime = input.nextInt();
			int copyServiceTime = serviceTime;
			int rank = input.nextInt();
			time+=serviceTime;
			char state = 'W';
			Job job = new Job(name, arriveTime, serviceTime,copyServiceTime, rank, state);
			ans[i] = job;
		}
		input.close();
		sort(ans);
		String pat = "";
		String copypat ="";
		int p =0;
		String string[] = {"开始","继续"};
		boolean flag = true;
		for (int i = 0; i < time; i++) {//算法主程序
			double revolveTime =0;
			double weightRevolveTime = 0;
			Job temp = Priority(i);//判断当前的这个时间段是否有进程已经到达
			if (!Priority(i).equals("NULL")) {//如果返回值不是null，表示返回的有正确的值
				char abs = temp.state;
				temp.state = 'R';//运行状态的变化
				if (!temp.name.equals(pat)) {//说明这一次的作业和原来的作业不一样
					ans[p].state = 'W';
				}
				if (flag) {
					ans[p].state = 'R';
					flag = false;
				}
					System.out.println("时刻 "+i+" "+"到时刻 "+(i+1+", ")+temp.name+" 作业执行,运行状态从  "+abs+" 转换成  "+temp.state);//如果下面一个作业的名字和这个不相同，运行状态还需要再继续转变回来

				//之后执行一分钟
				p = getname(temp.name);
				ans[p].serviceTime--;
				ans[p].rank-=n;
				if (temp.serviceTime == 0) {
					abs = temp.state;
					temp.state='F';
					revolveTime = i-temp.arriveTime;
					weightRevolveTime = (Math.round(revolveTime/temp.copyServiceTime*100.0))/100.0;
					System.out.println("时刻 "+i+" 到时刻  "+(i+1+", ")+temp.name+" 作业执行完成,运行状态从  "+abs+" 转换成  "+temp.state+
							",周转时间是  "+revolveTime+" 带权周转时间是 "+weightRevolveTime);
					pat = temp.name;
					if (p != -1) {//说明已经运行完毕
						ans[p].name="NULL";
						ans[p].arriveTime=-1;
						ans[p].serviceTime=-1;
						ans[p].state='F';
					}else {
						break;
					}
				}


			}
		}
	}
	public static int getname(String string) {
		for (int i = 0; i < ans.length; i++) {
			if (ans[i].name.equals(string)) {
				return i;
			}
		}
		return -1;
	}
	public static Job Priority(int start){
		List<Job> tempJob = new ArrayList<>();
		for (int i = 0; i < num; i++) {//传递进入一个时间，返回在此时间内执行时间最短的作业的对象
			if (ans[i].arriveTime <= start && ans[i].arriveTime!=-1 ) {
				String cat = ans[i].name;
				tempJob.add(ans[i]);
			}
		}//将小于这个值的所有Job都加入到list中
		if (tempJob.isEmpty()) {
			return new Job("NULL", -1, -1,1000,1000, 'a');
		}
		int max = -1000;
		int earlyTime = -1000;
		Job job = new Job("NUll", -1, -1,1000,1000, 'a') ;
		for (int i = 0; i < tempJob.size(); i++) {
			if(tempJob.get(i).rank >= max) {
				if (tempJob.get(i).rank == max) {
					if (tempJob.get(i).arriveTime < earlyTime) {//如果当前的这个作业的到达时间比原来作业的到达时间更小，说明更早到达
						job = tempJob.get(i);
						max = tempJob.get(i).rank;
						earlyTime = tempJob.get(i).arriveTime;
					}

				}else {
					job = tempJob.get(i);
					max = tempJob.get(i).rank;
					earlyTime = tempJob.get(i).arriveTime;
				}

			}
		}//返回最短的时间
		return job;
	}

	public static void sort(Job ans[]) {//对进入的所有作业根据到达时间进行排序
		for(int i =0 ; i<ans.length-1 ; i++) { 
			for(int j=0 ; j<ans.length-1-i ; j++) {  
				if(ans[j].arriveTime>ans[j+1].arriveTime) {
					Job temporacy = ans[j];
					ans[j]=ans[j+1];      
					ans[j+1]=temporacy;
				}
			}    
		}
		//		for (int i = 0; i < ans.length; i++) {
		//			System.out.println(ans[i].name+" "+ans[i].arriveTime+" "+ans[i].serviceTime);
		//		}
	}
}
class Job{
	/*
	 * name 表示作业名
	 * arriveTime表示进入时间
	 * serviceTime表示服务时间
	 * state 表示该作业当时所处的状态
	 */
	String name;
	int arriveTime;
	int copyServiceTime;
	int serviceTime;
	int rank;
	char state;
	public Job(String name,int arriveTime,int serviceTime,int copyServiceTime, int rank, char state) {
		super();
		this.name = name;
		this.arriveTime= arriveTime;
		this.serviceTime=serviceTime;
		this.copyServiceTime=copyServiceTime;
		this.rank=rank;
		this.state=state;
	}
}