战舰游戏：如何查看舰船周围情况并计算板上舰船的数量？

Question

我需要编写一个程序，该程序接受用户输入战舰板上的船只数量和板的大小（始终是方形的 - 所以如果尺寸 = 5，则板是 5x5）。 然后程序逐行取板并将其放入二维数组中。

我被卡住的地方是程序必须验证用户输入的板是否正确。 这既包括不允许接触的船只（甚至是对角线），也包括正确的船只数量。 该程序然后返回一个声明，要么说明板子正确，要么不正确。

这是我到目前为止的代码：

// This checks whether the boat is diagonal, horizontal or just length 1

static boolean checkType(int[][] board, int size) {
        for (int y = 0; y < 5; y++) {
            for (int x = 0; x < 5; x++) {
                if (board[x][y] == 1) {
                    if (board[x + 1][y] == 1) {
                        horizontalBoat(board, size, x, y);
                    } else if (board[x][y + 1] == 1) {
                        verticalBoat(board, size, x, y);
                    } else singleBoat(board, size, x, y);
                }
            }
        }
    }

/* Then for example the boat is horizontal, it passes the initial point through this 
method. What I have tried to do is for the for loop to continue until it has passed 
through all the points that the boat is at. Then it passes values into the second for 
loop which basically tries to check that the square around the ship on the board is all 
0s (as boats are also not allowed to touch diagonally) - hence why I have passed the position 
before the first 1 and the position after the last 1 of the boat into it. However for some 
reason the for statement won't loop. 
*/

 static boolean horizontalBoat(int[][] board, int size, int x, int y) {
        for (int c = x; c < size; ) {
            if (board[c][y] == 1) {
                c++;
            } else {
                int lastPositionX = c;
                if (((board[x - 1][y]) == 0) && ((board[x + 1][y]) == 0)) {
                    for (int firstPositionX = (x - 1); firstPositionX <= lastPositionX; firstPositionX++) {
                        if ((board[firstPositionX][y + 1] == 0) && (board[firstPositionX][y - 1] == 0)){
                        return true;
                        }
                    }
                }
            }
        }
        return false;
    }

// For context, this part of the code stores the board through user input. This part works.

public static void main(String[] args) {
        int ships_num;
        Scanner sc;
        int size;
        int[][] board;

        sc = new Scanner(System.in);

        do {
            System.out.println("Enter the number of boats. The max is 10  ");
            ships_num = sc.nextInt();
        } while (ships_num > 10);
        System.out.println("Number of boats " + ships_num);

        do {
            System.out.println("Enter the size of the board. The max is 20");
            size = sc.nextInt();
        } while (size > 20);
        System.out.println("El tamano del tablero: " + size);

        board = new int[size][size];

        for (int y = 0; y < size; y++) {
            System.out.println("Enter the values of each row of the board, starting with"
  +"the first. Enter 1 to represent a ship and 0 to represent water.");
            String temp = sc.next();
            for (int x = 0; x < size; x++) {
                board[x][y] = temp.charAt(x);
            }
        }

另外，我想尝试创建一个 int ship_num_check ，每次船完成时都会添加一个，所以最后我可以将它与应该有的船数量进行比较。 但是，由于 scope，我不确定如何跨方法执行此操作？

任何帮助将不胜感激，因为我非常卡住。 谢谢：）

Answer 1

这是一个扩展评论，而不是答案。

这是创建测试程序的一种方法。 此代码基于以下假设。

1. 一艘船的长度可以是从 1 到输入网格的宽度和高度。
2. 船可以水平、垂直或对角放置。
3. 没有两艘船可以水平、垂直或对角接触。

结果应该是

true
false

这是测试床代码。 随意添加尽可能多的输入网格来测试您的代码。

public class BattleshipTesting {

    public static void main(String[] args) {
        // Valid grid
        int numberOfShips1 = 4;
        int[][] inputGrid1 = { { 0, 0, 1, 1, 1, 0, 0 }, 
                            { 0, 0, 0, 0, 0, 0, 0 }, 
                            { 0, 1, 0, 0, 0, 0, 0 }, 
                            { 0, 0, 1, 0, 0, 1, 0 }, 
                            { 0, 0, 0, 0, 0, 1, 0 }, 
                            { 0, 1, 1, 1, 0, 1, 0 }, 
                            { 0, 0, 0, 0, 0, 1, 0 } };
        System.out.println(verifyGrid(numberOfShips1, inputGrid1));
        
        // Invalid grid
        int numberOfShips2 = 5;
        int[][] inputGrid2 = { { 0, 0, 1, 1, 1, 0, 0 }, 
                            { 0, 0, 0, 0, 0, 0, 0 }, 
                            { 0, 1, 0, 0, 0, 0, 0 }, 
                            { 1, 0, 1, 0, 0, 1, 0 }, 
                            { 1, 0, 0, 0, 0, 1, 0 }, 
                            { 0, 1, 1, 1, 0, 1, 0 }, 
                            { 0, 0, 0, 0, 0, 1, 0 } };
        System.out.println(verifyGrid(numberOfShips2, inputGrid2));
    }
    
    public static boolean verifyGrid(int numberOfShips, int[][] inputGrid) {
        // Here's where your testing logic goes
        return true;
    }

}

当您有一个有效的verifyGrid方法时，您可以重新添加您的Scanner代码。

将您的代码分解成小的（10 行或更少）可测试的方法。