From 522984ba98a3e922c89084f3dae9fc96e65141ee Mon Sep 17 00:00:00 2001
From: rimogsu <newnyup@gmail.com>
Date: Mon, 17 Aug 2026 12:42:22 +0900
Subject: [PATCH] 3978

---
 .../v2/3978. Unique Middle Element.py"           | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/v2/3978. Unique Middle Element.py"

diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v2/3978. Unique Middle Element.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v2/3978. Unique Middle Element.py"
new file mode 100644
index 00000000..e356a48c
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v2/3978. Unique Middle Element.py"	
@@ -0,0 +1,16 @@
+
+'''
+1. 아이디어 :
+middle 원소 구하고, 그 원소가 유일한지 확인한다.
+
+2. 시간복잡도 :
+    o(n)
+3. 자료구조/알고리즘 :
+'''
+
+
+class Solution:
+    def isMiddleElementUnique(self, nums: list[int]) -> bool:
+        n = len(nums)
+        middle = nums[n//2]
+        return True if 1 == len([i for i in nums if i == middle]) else False
\ No newline at end of file