Leetcode Problem 348. Design Tic-Tac-Toe

348. Design Tic-Tac-Toe

Leetcode Solutions

Initialize arrays rows and cols of size n to zero, and integers diagonal and antiDiagonal to zero.
For each move by player 1, increment the counters rows[row], cols[col], and if the move is on the diagonal, diagonal, or if it's on the anti-diagonal, antiDiagonal.
For each move by player 2, perform the same operation but decrement the counters.
After each move, check if any of the updated counters equal n or -n. If so, the current player wins.
Return the player number if they win, or 0 otherwise.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen