我试图在Java中实现Banker的算法,但是我在加载数组时遇到了问题。以下是我使用
的代码public static void main(String[] args) throws FileNotFoundException {
String filename = null;
int need[][];
int allocate[][];
int max[][];
int available[][];
int n = 0;
int m = 0;
int lineCount = 0;
Scanner in = new Scanner(System.in);
System.out.println("Enter the file name.");
filename = in.nextLine();
File textFile = new File(filename);
Scanner input = new Scanner(textFile);
max = new int[n][m];
allocate = new int[n][m];
need = new int[n][m];
available = new int[1][m];
n = input.nextInt();
m = input.nextInt();
System.out.print("Number of Processes: " + n);
System.out.print("\nNumber of Processes: " + m);
max = new int[n][m];
allocate = new int[n][m];
need = new int[n][m];
available = new int[1][m];
String line = input.nextLine();
while (line != null && lineCount < n) {
String[] temp = line.split(" ");
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
allocate[i][j] = Integer.parseInt(line);
System.out.println("here");
}
line = input.nextLine();
lineCount++;
}
}
}
我的示例文件包含此数据。
5
4
0 0 1 2 1 0 0 0 1 3 5 4 0 6 3 2 0 0 1 4
0 0 1 2 1 7 5 0 2 3 5 6 0 6 5 2 0 6 5 6
1 5 2 0
1:0 4 2 0
因此,在尝试执行此操作时,我遇到了许多不同的错误。现在我得到一个NumberFormatException:对于输入字符串&#34;&#34;错误。非常感谢任何帮助。
答案 0 :(得分:0)
你有一堆非常小的数组,你永远不会增加它们的大小:
int n = 0;
int m = 0;
...
max = new int[n][m]; // 0x0 array, unused
allocate = new int[n][m]; // 0x0 array, likely the culprit
need = new int[n][m]; // 0x0 array, unused
available = new int[1][m]; // 1x0 array, unused
在这些数组中,仅使用allocate
,稍后您将在for循环中使用它:
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
// OutOfBounds is probably here:
allocate[i][j] = Integer.parseInt(line);
System.out.println("here");
}
line = input.nextLine();
lineCount++;
}
此外,您正在运行Integer.parseInt(line)
,它正在尝试解析整行。您应该一次解析一个令牌Integer.parseInt(temp[someindex])
。