์ฒ์์๋ ์์ ๋์ด๋ธ ํ๊ฒ ์ฝ๋๋ฅผ ์งฐ์๋ค.
for i in range(n):
for j in range(n):
if i==j:
continue
if len(phone_book[i]) > len(phone_book[j]):continue
if phone_book[i] == phone_book[j][0:len(phone_book[i])]:
print(phone_book[i])
return False
ํ์ง๋ง ์๊ฐ๋ณต์ก๋๊ฐ O(N^2)์ด๋ค ๋ณด๋ ํจ์จ์ฑ ํ ์คํธ์์ ๋จ์ด์ง๋ ๋ฌธ์ ๊ฐ ๋ฐ์ํ๋ค.
def solution(phone_book):
n = len(phone_book)
phone_book.sort()
for i in range(1,n):
if phone_book[i-1] in phone_book[i]
return False
return True
์์ ๊ฐ์ด ์์ ์ ํ์์ผ๋ ์ด๋ ์ ๋์ฌ๊ฐ ์๋ ๊ฒฝ์ฐ๋ ๊ณ ๋ คํ๊ธฐ ๋๋ฌธ์ ์ ๋ต์ด ๋ ์ ์๋ค.
def solution(phone_book):
n = len(phone_book)
phone_book.sort()
for i in range(1,n):
if phone_book[i-1] == phone_book[i][0:len(phone_book[i-1])]:
return False
return True
๋ฐ๋ผ์ ์๊ฐ์ด ํจ์ผ๋ก์จ ๋ฌธ์ ๋ฅผ ํด๊ฒฐํ ์ ์์๋ค.