我正在将此文本文件输入到命令行中:
800 5 10
800 1 8
800 7 7
810 2 9
845 2 10
850 1 3
第一列是时间,然后是优先级,然后是长度
输出按时间加长度排序,如果该项的时间小于等于当前时间,则输出下一项,优先级最高的先(是它令人困惑,但它是一个类项目)
这将输出:
Job: [800,1,8] Start time: 800 End time:808
Job: [800,5,10] Start time: 800 End time:818
Job: [810,2,9] Start time: 810 End time: 819
Job: [800,7,7] Start time: 800 End time: 807
Job: [845,2,10] Start time: 845 End time 855
Job: [850,1,3] Start time: 850 End time: 853
我使用带有称为事件的队列方法的链表和称为队列的优先级队列
我的问题是while循环while (event.size() != 0 && queue.size() != 0)
根本没有执行。
如果我将其更改为 do while 循环,我会在 while 上收到空指针异常错误(event.peek().time <= currentTime)
,if (event.peek().time > currentTime)
我已尝试通过添加来修复空指针异常event.peek() != null
,但它仍然无法正常工作。事件(链表)中有 6 个作业对象,所以我不知道为什么 event.peek() 返回 null。
import java.util.*;
import java.io.*;
public class pj2
{
Queue<Job> event = new LinkedList<Job>();//interface queue
PriorityQueue<Job> queue = new PriorityQueue<Job>();
public static void main(String[] args) throws IOException
{
if (args.length != 1)
{
System.out.println("Usage: java pj2 jobs.txt");
System.exit(0);
}
else
new pj2(args[0]);
}
public pj2 (String textFile) throws IOException
{
File file = new File(textFile);
if (!file.exists())
{
System.out.println(textFile + " does not exist.");
System.exit(0);
}
//add time,priority,length to event queue
Scanner data = new Scanner(file);
while (data.hasNext())
{
int time = Integer.parseInt(data.next());
int priority = Integer.parseInt(data.next());
int length = Integer.parseInt(data.next());
Job temp = new Job(time,priority,length);
event.add(temp);
}
data.close();
int currentTime = 0;
//loop through priority queue, outputting results
while (event.size() != 0 && queue.size() != 0)
{
if (queue.size() == 0)
currentTime = event.peek().time;
while (event.peek().time <= currentTime)
{
currentTime += event.peek().length;
queue.offer(event.poll());
}
if (event.peek().time > currentTime)
{
currentTime = (event.peek().time + event.peek().length);
queue.offer(event.poll());
}
System.out.println(queue.peek() + " Start time: " + queue.peek().time + " End time: " + (queue.peek().time + queue.peek().length));
queue.poll();
}
}
}
public class Job implements Comparable<Job>
{
int time, length, priority;
public Job(int time, int priority, int length)
{
this.time = time;
this.priority = priority;
this.length = length;
}
public int compareTo(Job that)
{
if (this.priority == that.priority)
return this.time - that.time;
return this.priority - that.priority;
}
public String toString()
{
return "[" + time + "," + priority + "," + length + "]";
}
}