Category: Matrix

function spiralMatrix(dimension) {

    let matrix = [];
    // create blank matrix based from given dimension
    for (let i = 0; i < dimension; i++) {
        matrix.push(new Array(dimension).fill(0))
    }

    let counter = 1;
    let startRow = 0, endRow = dimension, startColumn = 0, endColumn = dimension;


    while (startRow < endRow && startColumn < endColumn) {

        // top left -> top right
        for (let i = startColumn; i < endColumn; i++) {
            matrix[startRow][i] = counter++;
        }
        startRow++

        // top right -> bottom right
        for (let i = startRow; i < endRow; i++) {
            matrix[i][endColumn - 1] = counter++;
        }
        endColumn--;

        // bottom right -> bottom left
        for (let i = endColumn - 1; i >= startColumn; i--) {
            matrix[endRow - 1][i] = counter++;
        }
        endRow--;


        // bottom left -> top left
        for (let i = endRow; i > startRow; i--) {
            matrix[i - 1][startColumn] = counter++;
        }
        startColumn++;

    }

     return matrix;
}

let gameOfLife = function(board) {

    if (!board) return [];

    let copy = [],
        LIVE = 1,
        DEAD = 0,
        maxRow = board.length - 1,
        maxCol = board[0].length - 1;

    function getAdjacentCount(row, col, valueToCompare) {
        let sum = 0;
        for (let i = Math.max(row - 1, 0); i <= Math.min(row + 1, maxRow); i++) {
            for (let j = Math.max(col - 1, 0); j <= Math.min(col + 1, maxCol); j++) {
                if (i === row && j === col) continue;
                if (copy[i] && copy[i][j] !== undefined) {
                    if (copy[i][j] === valueToCompare) sum = sum + 1; //?
                }
                else {
                    if (board[i][j] === valueToCompare) sum = sum + 1; //?
                }
            }
        }
        return sum;
    }

    function getNextValue(row, col) {
        const val = board[row][col];
        let liveNeighbors = getAdjacentCount(row, col, LIVE);
        if (val === LIVE) {

            // Any live cell with fewer than two live neighbors dies, as if caused by under-population.
            if (liveNeighbors < 2) {
                return DEAD;
            }
            // Any live cell with more than three live neighbors dies, as if by over-population..
            else if (liveNeighbors > 3) {
                return DEAD;
            }
            // Any live cell with two or three live neighbors lives on to the next generation.
            return LIVE;
        }
        // cell is DEAD
        else {
            // Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
            if (liveNeighbors === 3) {
                return LIVE;
            }
            // no condition
            return DEAD;
        }
    }

    for (let row = 0; row <= maxRow; row++) {
        copy[row] = [];
        for (let col = 0; col <= maxCol;col++) {
            copy[row][col] = board[row][col];
            board[row][col] = getNextValue(row, col);
        }
    }

};