目前能够计算总邻居，我只需要活着的邻居

Question

我有一个布尔[，]板，该木板存储，如果细胞还活着或死亡。我提供的代码正确地告诉我每个单元格的总邻居，问题是我只需要计算活着的邻居。我的想法是对这些

   if (WithinBounds (row, col) ) {
      if (board[row, col] == true)
         liveNeighbor++;

是我的两种相关方法来计算总邻居。

        private int TotalLiveNeighbors(int x, int y)
        {
            int liveNeighbors = 0;


            for (int row = x - 1; row <= x + 1; row++)
            {
                for (int col = y - 1; col <= y + 1; col++)
                {
                    if (! (row == x && col == y))
                    {
                        if (WithinBounds(row, col)) {
                            liveNeighbors++;
                        }

                    }
                }
            }

            return liveNeighbors;
        }

        public bool WithinBounds(int x, int y)
        {
            if (x < 0 || y < 0)
                return false;
            if (x >= 3 || y >= 3)
                return false;
            
            return true;
        }

我还在研究一种使用偏移的不同方法：

int[,] neighborLocations = { { -1,-1 }, { -1,0 }, { -1, +1 },
                             { 0, -1},            { 0, +1 },
                             {+1, -1},  {+1, 0 }, { +1, +1 } };

int countAliveNeighbors (int x, int y) {
    int count = 0;
    foreach (int[] offset in neighborLocations) {
        if (board.hasAliveNeighborsAt(x + offset[1], y + offset[0])
            count++;
    }
    return count;
}

不确定这是否比我的第一种方法更有效

Answer 1

假设阵列称为“活着”

 if (alive[row,col] && WithinBounds(row, col))