[英]Array index out of bounds Java game of life?
我正在嘗試為我的Java編程類做一些“生活游戲”項目,我認為我做對了所有事情,但是由於某種原因,即使我沒有任何數字大於該值,我仍然會遇到異常索引。 想知道為什么會引發此錯誤?
碼:
專案4:
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Project4 {
public static void main(String[] args) throws IOException {
Scanner input = new Scanner(System.in); // Created a scanner
System.out.println("Enter the file name you would like to use");
File file = new File(input.nextLine()); // Takes file name to find file
Scanner inputFromFile = new Scanner(file);
FileInputStream fileInput = new FileInputStream(file); // reads file
int r;
int y = 0;
int i = 0;
while ((r = fileInput.read()) != -1) { // goes through each character in
// file, char by char
char c = (char) r;
GameOfLife.grid[i][y] = c;
y++;
if (y == 75) {
y = 0;
i++;
if (i == 25) {
break;
}
}
}
// Prints the initial environment
System.out.println("Initial set: ");
for (int j = 0; j < GameOfLife.grid.length; j++) {
System.out.print(GameOfLife.grid[j]);
}
System.out.println("Do you want to see the next generation? Y/N?");
String q = input.nextLine();
if (q.equalsIgnoreCase("y")) {
GameOfLife.evolve();
} else {
System.exit(0);
}
}
}
游戲人生:
import java.util.Arrays;
public class GameOfLife {
static final int m = 25; // number of rows
static final int n = 75; // number of columns
static char[][] grid = new char[m][n]; // Creates an empty (no dots or
// X's)grid of rows and columns.
static int count_neighbors(int i, int j) {
int nn = 0; // number of neighbors of cell(i,j)
if (grid[i - 1][j - 1] == 'X') {
nn++;
}
;
if (grid[i - 1][j] == 'X') {
nn++;
}
;
if (grid[i - 1][j + 1] == 'X') {
nn++;
}
;
if (grid[i][j - 1] == 'X') {
nn++;
}
;
if (grid[i][j + 1] == 'X') {
nn++;
}
;
if (grid[i + 1][j - 1] == 'X') {
nn++;
}
;
if (grid[i + 1][j] == 'X') {
nn++;
}
;
if (grid[i + 1][j + 1] == 'X') {
nn++;
}
return nn;
}
static void evolve() {
for (int i = 0; i < 23; i++) {
for (int j = 0; j < 73; j++) {
int s = count_neighbors(i, j);
if (s < 2) {
grid[i][j] = '.';
}
if (s == 2 || s == 3) {
grid[i][j] = 'X';
}
if (s > 3) {
grid[i][j] = '.';
}
}
for (int j = 0; j < GameOfLife.grid.length; j++)
System.out.print(GameOfLife.grid[j]);
}
}
}
要擴展Anton的職位,雖然您需要仍然指望拐角處的鄰居,但必須考慮到您在拐角處並且只能指望某些邊的事實:
static int count_neighbors(int i, int j) {
int nn = 0; // number of neighbors of cell(i,j)
if (i > 0 && j > 0 && grid[i - 1][j - 1] == 'X') {
nn++;
}
;
if (i > 0 && grid[i - 1][j] == 'X') {
nn++;
}
;
if (i > 0 && j < 72 && grid[i - 1][j + 1] == 'X') {
nn++;
}
;
if (j > 0 && grid[i][j - 1] == 'X') {
nn++;
}
;
if (j < 72 && grid[i][j + 1] == 'X') {
nn++;
}
;
if (j > 0 && i < 22 && grid[i + 1][j - 1] == 'X') {
nn++;
}
;
if (i < 22 && grid[i + 1][j] == 'X') {
nn++;
}
;
if (i < 22 && j < 72 && grid[i + 1][j + 1] == 'X') {
nn++;
}
return nn;
}
你叫count_neighbors
在您的(0,0) evolve
方法。 順便說一下,我很確定,該編譯器為您提供了拋出此異常的行。
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.