You are given two $0$ indexed integer arrays player1 and player2, representing the number of pins knocked down by player $1$ and player $2$ in a bowling game consisting of $n$ turns.

The score of a player is calculated as the sum of points awarded in each turn. The points awarded in turn i are defined as:

• $2 imes$ player1[i] (or $2 imes$ player2[i]) if the player knocked down $10$ pins in turn $i - 1$ or turn $i - 2$.

• $1 imes$ player1[i] (or $1 imes$ player2[i]) otherwise.

Determine the winner of the game:

• Return $1$ if the total score of player $1$ is strictly greater than the total score of player $2$.

• Return $2$ if the total score of player $2$ is strictly greater than the total score of player $1$.

• Return $0$ if both players have the same total score.

Constraints:

• n $=$ player1.length $=$ player2.length

• $1 \leq$ n $\leq 1000$

• $0 \leq$ player1[i], player2[i] $\leq 10$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.