时间戳

首页 > 解决方案 > 我如何才能读取每个空单元格周围有多少地雷。游戏扫雷

java - 我如何才能读取每个空单元格周围有多少地雷。游戏扫雷

问题描述

下面的程序询问用户他想在场地上看到多少地雷，然后显示带有地雷的场地。在下一步中，我需要计算每个空单元周围有多少地雷。而且我知道如果单元格在中间，我需要检查 8 个单元格，如果单元格在侧面，我需要检查 5 个单元格，如果单元格在角落里，我需要检查 3 个单元格。如果单元格周围有 1 到 8 个地雷，我需要输出地雷的数量，而不是代表空单元格的符号。

import java.util.Scanner;
import java.util.Random;

public class Minesweeper {

    char[][] minesweeper = new char[9][9];
    Random randNum = new Random();
    Scanner sc = new Scanner(System.in);

    public Minesweeper() {
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                minesweeper[i][j] = '*';
            }
        }
    }

    public void printMinesweeper() {
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                System.out.print(minesweeper[i][j]);
            }
            System.out.println();
        }
    }

    public void randomX() {
        System.out.print("How many mines do you want on the field?: ");
        int numberOfMines = sc.nextInt();
        int i = 0;
        while (i < numberOfMines) {
            int x = randNum.nextInt(9);
            int y = randNum.nextInt(9);
            if (minesweeper[x][y] == '*') {
                minesweeper[x][y] = 'X';
                i++;
            }
        }
        printMinesweeper();

    }
}

标签： javaminesweeper

解决方案

你可以这样做：

import java.util.Random;
import java.util.Scanner;

public class Minesweeper {
    
    public static void main(String[] args) {
        Minesweeper minesweeper = new Minesweeper();
        minesweeper.randomX();
        minesweeper.printMinesweeper();
    }
    
    char[][] minesweeper = new char[9][9];
    Random randNum = new Random();
    Scanner sc = new Scanner(System.in);
    
    public Minesweeper() {
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                minesweeper[i][j] = '*';
            }
        }
    }
    
    public void printMinesweeper() {
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                System.out.print(getCharAt(i, j));
            }
            System.out.println();
        }
    }
    
    private String getCharAt(int i, int j) {
        if (mineAt(i, j)) {
            return "X";
        }
        
        int minesNear = countMinesNear(i, j);
        return Integer.toString(minesNear);
    }
    
    private boolean mineAt(int i, int j) {
        return minesweeper[i][j] == 'X';
    }
    
    private int countMinesNear(int i, int j) {
        int mines = 0;
        for (int x = -1; x <= 1; x++) {//near fields in x direction
            for (int y = -1; y <= 1; y++) {//near fields in y direction
                if (x + i >= 0 && x + i < minesweeper.length && y + j >= 0 && y + j < minesweeper.length) {//check whether the field exists
                    if (minesweeper[x+i][y+j] == 'X') {//check whether the field is a mine
                        mines++;
                    }
                }
            }
        }
        return mines;
    }

    public void randomX() {
        System.out.print("How many mines do you want on the field?: ");
        int numberOfMines = sc.nextInt();
        int i = 0;
        while (i < numberOfMines) {
            int x = randNum.nextInt(9);
            int y = randNum.nextInt(9);
            if (minesweeper[x][y] == '*') {
                minesweeper[x][y] = 'X';
                i++;
            }
        }
        printMinesweeper();
        
    }
}

该countMinesNear(int, int)方法检查附近的字段是否存在（以防止边缘上的索引错误）并在字段存在时对地雷进行计数。

推荐阅读