An attacking character inflicts a poison condition on a target. When an attack lands at second t, the target remains poisoned for duration seconds, covering the inclusive time interval $[t, t + ext{duration} - 1]$. If another attack lands before the previous poison effect ends, the effect timer resets and extends for duration seconds starting from the timestamp of the new attack.

You are given an integer array timeSeries sorted in nondecreasing order, where timeSeries[i] represents the second at which an attack lands, along with an integer duration.

Return the total number of seconds that the target remains poisoned.

Constraints:

• $1 \leq$ timeSeries.length $\leq 10^4$

• $0 \leq$ timeSeries[i], duration $\leq 10^7$

• timeSeries is sorted in nondecreasing order.

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.