[LeetCode Sync] Runtime - 481 ms (67.06%), Memory - 39.8 MB (89.10%)

Author: NamVr

3437-maximum-total-damage-with-spell-casting/README.md

@@ -0,0 +1,42 @@
+<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>

3437-maximum-total-damage-with-spell-casting/solution.py

@@ -0,0 +1,34 @@
+class Solution:
+    def maximumTotalDamage(self, power):
+        damageFrequency = defaultdict(int)
+        for damage in power:
+            damageFrequency[damage] += 1
+
+        uniqueDamages = sorted(damageFrequency.keys())
+        totalUniqueDamages = len(uniqueDamages)
+        maxDamageDP = [0] * totalUniqueDamages
+
+        maxDamageDP[0] = uniqueDamages[0] * damageFrequency[uniqueDamages[0]]
+
+        for i in range(1, totalUniqueDamages):
+            currentDamageValue = uniqueDamages[i]
+            currentDamageTotal = currentDamageValue * damageFrequency[currentDamageValue]
+
+            maxDamageDP[i] = maxDamageDP[i - 1]
+
+            previousIndex = i - 1
+            while (previousIndex >= 0 and 
+                   (uniqueDamages[previousIndex] == currentDamageValue - 1 or 
+                    uniqueDamages[previousIndex] == currentDamageValue - 2 or 
+                    uniqueDamages[previousIndex] == currentDamageValue + 1 or 
+                    uniqueDamages[previousIndex] == currentDamageValue + 2)):
+                previousIndex -= 1
+
+            if previousIndex >= 0:
+                maxDamageDP[i] = max(maxDamageDP[i], maxDamageDP[previousIndex] + currentDamageTotal)
+            else:
+                maxDamageDP[i] = max(maxDamageDP[i], currentDamageTotal)
+
+        return maxDamageDP[totalUniqueDamages - 1]
+
+