Merge pull request #2011 from CodingTestStudy2/최민지

[최민지] Day11

Author: github-actions[bot]

leetcode3/최민지/3467.py

@@ -0,0 +1,11 @@
+class Solution:
+    def transformArray(self, nums: List[int]) -> List[int]:
+        odd, even = 0, 0
+        for n in nums:
+            if n % 2 == 0:
+                even += 1
+            else:
+                odd += 1
+        result = [0] * even + [1] * odd
+    
+        return result