Skip to content

[변지협] Day19 #1848

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
github-actions merged 1 commit into from
Aug 17, 2026
Merged

[변지협] Day19 #1848

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions leetcode3/변지협/v2/3978. Unique Middle Element.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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