Merge pull request #1644 from choifi/choiminji

[최민지] Day08

Author: github-actions[bot]

leetcode3/최민지/3392_count-subarrys-of-length.py

@@ -0,0 +1,8 @@
+class Solution:
+    def countSubarrays(self, nums: List[int]) -> int:
+        result = 0
+        for i in range(len(nums)-2):
+            if nums[i+1] == 2 * (nums[i] + nums[i+2]):
+                result += 1
+        return result
+        

leetcode3/최민지/537.py

@@ -0,0 +1,8 @@
+class Solution:
+    def complexNumberMultiply(self, num1: str, num2: str) -> str:
+        real1, imag1 = map(int, num1[:-1].split("+"))
+        real2, imag2 = map(int, num2[:-1].split("+"))
+        result1 = real1 * real2 - imag1 * imag2
+        result2 = real1 * imag2 + imag1 * real2
+        return str(result1) + "+" + str(result2) + "i"
+