Adding solution

nityansuman · nityansuman · commit 341d3b8620fd · 2022-11-26T21:19:16.000Z
diff --git a/leetcode/1470_shuffle_the_array.py b/leetcode/1470_shuffle_the_array.py
@@ -0,0 +1,17 @@
+# https://leetcode.com/problems/shuffle-the-array/
+
+from typing import List
+
+class Solution:
+	def shuffle(self, nums: List[int], n: int) -> List[int]:
+		shuffled_arr = list()
+		i = 0
+		while i < n:
+			shuffled_arr.extend((nums[i], nums[i+1]))
+			i += 1
+
+		return shuffled_arr
+
+# Note:
+# 1. Extend better than multiple appens
+# 2. List creation more expensive than tuple
diff --git a/leetcode/1480_running_sum_of_1d_array.py b/leetcode/1480_running_sum_of_1d_array.py
@@ -0,0 +1,7 @@
+# https://leetcode.com/problems/running-sum-of-1d-array/
+
+from typing import List
+
+class Solution:
+	def runningSum(self, nums: List[int]) -> List[int]:
+		return [sum(nums[:i+1]) for i in range(len(nums))]
diff --git a/leetcode/2011_final_value_after_operations.py b/leetcode/2011_final_value_after_operations.py
@@ -0,0 +1,13 @@
+# https://leetcode.com/problems/final-value-of-variable-after-performing-operations/
+
+from typing import List
+
+class Solution:
+	def finalValueAfterOperations(self, operations: List[str]) -> int:
+		x = 0
+		for opr in operations:
+			if "--" in opr:
+				x -= 1
+			else:
+				x += 1
+		return x
