You are keeping score for a baseball game with special rules. At the beginning, the record is empty.

You are given an array of strings operations, where operations[i] is the operation to apply at index i:

• An integer x: Add a new score of $x$ to the record.

• "+": Add a new score that is the sum of the previous $2$ scores.

• "D": Add a new score that is double the previous score.

• "C": Invalidate and remove the previous score from the record.

Return the sum of all scores present on the record after applying all the operations.

Constraints:

• $1 \leq$ operations.length $\leq 1000$

• operations[i] is "C", "D", "+", or a string representing an integer in the range $[-3 imes 10^4, 3 imes 10^4]$

• For operation "+", there will always be at least $2$ previous scores on the record

• For operations "C" and "D", there will always be at least $1$ previous score on the record

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.