Sync LeetCode submission Runtime - 3 ms (34.56%), Memory - 18.1 MB (7.56%)

Author: jimit105

2551-apply-operations-to-an-array/README.md

@@ -0,0 +1,48 @@
+<p>You are given a <strong>0-indexed</strong> array <code>nums</code> of size <code>n</code> consisting of <strong>non-negative</strong> integers.</p>
+
+<p>You need to apply <code>n - 1</code> operations to this array where, in the <code>i<sup>th</sup></code> operation (<strong>0-indexed</strong>), you will apply the following on the <code>i<sup>th</sup></code> element of <code>nums</code>:</p>
+
+<ul>
+	<li>If <code>nums[i] == nums[i + 1]</code>, then multiply <code>nums[i]</code> by <code>2</code> and set <code>nums[i + 1]</code> to <code>0</code>. Otherwise, you skip this operation.</li>
+</ul>
+
+<p>After performing <strong>all</strong> the operations, <strong>shift</strong> all the <code>0</code>&#39;s to the <strong>end</strong> of the array.</p>
+
+<ul>
+	<li>For example, the array <code>[1,0,2,0,0,1]</code> after shifting all its <code>0</code>&#39;s to the end, is <code>[1,2,1,0,0,0]</code>.</li>
+</ul>
+
+<p>Return <em>the resulting array</em>.</p>
+
+<p><strong>Note</strong> that the operations are applied <strong>sequentially</strong>, not all at once.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,2,1,1,0]
+<strong>Output:</strong> [1,4,2,0,0,0]
+<strong>Explanation:</strong> We do the following operations:
+- i = 0: nums[0] and nums[1] are not equal, so we skip this operation.
+- i = 1: nums[1] and nums[2] are equal, we multiply nums[1] by 2 and change nums[2] to 0. The array becomes [1,<strong><u>4</u></strong>,<strong><u>0</u></strong>,1,1,0].
+- i = 2: nums[2] and nums[3] are not equal, so we skip this operation.
+- i = 3: nums[3] and nums[4] are equal, we multiply nums[3] by 2 and change nums[4] to 0. The array becomes [1,4,0,<strong><u>2</u></strong>,<strong><u>0</u></strong>,0].
+- i = 4: nums[4] and nums[5] are equal, we multiply nums[4] by 2 and change nums[5] to 0. The array becomes [1,4,0,2,<strong><u>0</u></strong>,<strong><u>0</u></strong>].
+After that, we shift the 0&#39;s to the end, which gives the array [1,4,2,0,0,0].
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,1]
+<strong>Output:</strong> [1,0]
+<strong>Explanation:</strong> No operation can be applied, we just shift the 0 to the end.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 2000</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>
+</ul>

2551-apply-operations-to-an-array/solution.py

@@ -0,0 +1,24 @@
+# Approach 1: Brute Force Simulation
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def applyOperations(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        modified_nums = []
+
+        for index in range(0, n - 1):
+            if nums[index] == nums[index + 1] and nums[index] != 0:
+                nums[index] *= 2
+                nums[index + 1] = 0
+
+        for num in nums:
+            if num != 0:
+                modified_nums.append(num)
+
+        while len(modified_nums) < n:
+            modified_nums.append(0)
+
+        return modified_nums
+