def solution(n, words):
a = []
k = len(words)
count=0; change=0
for i in range(k-1):
m = len(words[i])
if(a.count(words[i])==0 and a.count(words[i+1])==0 and words[i][m-1]==words[i+1][0]):
a.append(words[i]); count+=1
else: change=1; break
ans = count+2
p = ans%n
q = ans//n+1
if(p==0): p=n; q=ans//n
if(change==0): return [0,0]
return [p,q]'프로그래머스' 카테고리의 다른 글
| Level2 구명보트 (0) | 2022.02.03 |
|---|---|
| Level2 주식가격 (0) | 2022.02.03 |
| Level1 폰켓몬 (0) | 2022.02.02 |
| Level1 체육복 (0) | 2022.02.02 |
| Level1 모의고사 (0) | 2022.02.02 |
댓글