<p>A magician has various spells.</p>

<p>You are given an array <code>power</code>, where each element represents the damage of a spell. Multiple spells can have the same damage value.</p>

<p>It is a known fact that if a magician decides to cast a spell with a damage of <code>power[i]</code>, they <strong>cannot</strong> cast any spell with a damage of <code>power[i] - 2</code>, <code>power[i] - 1</code>, <code>power[i] + 1</code>, or <code>power[i] + 2</code>.</p>

<p>Each spell can be cast <strong>only once</strong>.</p>

<p>Return the <strong>maximum</strong> possible <em>total damage</em> that a magician can cast.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">power = [1,1,3,4]</span></p>

<p><strong>Output:</strong> <span class="example-io">6</span></p>

<p><strong>Explanation:</strong></p>

<p>The maximum possible damage of 6 is produced by casting spells 0, 1, 3 with damage 1, 1, 4.</p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">power = [7,1,6,6]</span></p>

<p><strong>Output:</strong> <span class="example-io">13</span></p>

<p><strong>Explanation:</strong></p>

<p>The maximum possible damage of 13 is produced by casting spells 1, 2, 3 with damage 1, 6, 6.</p>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= power.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= power[i] &lt;= 10<sup>9</sup></code></li>
</ul>

import numpy as np
from collections import Counter

class Solution:
    def maximumTotalDamage(self, power):
        counts = Counter(power)
        power = sorted(counts.keys())

        dp = [0] * len(power)
        dp[0] = power[0] * counts[power[0]]

        for i in range(1, len(power)):
            if power[i] >= power[i - 1] + 3:
                idx = i - 1
            elif power[i] >= power[max(0, i - 2)] + 3:
                idx = i - 2
            else:
                idx = i - 3
            if idx >= 0:
                dp[i] = max(power[i] * counts[power[i]] + dp[idx], dp[i - 1])
            else:
                dp[i] = max(power[i] * counts[power[i]], dp[i - 1])

        return dp[-1]


        # power = np.array(power)
        # if len(power) == 0:
        #     return 0
        # if len(power) == 1:
        #     return power[0]
        # power = np.array(power)
        # idx1 = power == power[0]
        # idx2 = np.abs(power - power[0]) > 2
        # return max(idx1.sum() * power[0] + self.maximumTotalDamage(power[idx2]), self.maximumTotalDamage(power[~idx1]))

        
48781