Problem Description
You are given two 0-indexed integer arrays player1 and player2, representing the number of pins that player 1 and player 2 hit in a bowling game, respectively. The bowling game consists of n turns, and the number of pins in each turn is exactly 10. Assume a player hits x_i pins in the i-th turn. The value of the i-th turn for the player is:
- 2x_i if the player hits 10 pins in either (i - 1)-th or (i - 2)-th turn.
- Otherwise, it is x_i.
The score of the player is the sum of the values of their n turns. Return:
- 1 if the score of player 1 is more than the score of player 2,
- 2 if the score of player 2 is more than the score of player 1, and
- 0 in case of a draw.
Key Insights
- The scoring mechanism is dependent on the previous two turns.
- Hitting 10 pins in the previous two turns doubles the score of the current turn.
- We need to iterate through the arrays while keeping track of previous scores for accurate calculations.
Space and Time Complexity
Time Complexity: O(n)
Space Complexity: O(1)
Solution
To solve the problem, we will use a simple iterative approach. We will maintain two scores, one for each player, and iterate through the turns. For each player's turn, we will check if they hit 10 pins in the previous two turns to determine if their current score should be doubled. The algorithm will keep track of the total scores and finally compare them to determine the winner.