Closed ji-0630 closed 1 year ago
def solution(n, words):
answer = []
for i in range(1, len(words)):
if words[i][0] != words[i-1][-1]:
if (i+1) % n == 0:
answer.append(n)
else:
answer.append((i+1) % n)
answer.append(i//n + 1)
break
else:
if words[:i].count(words[i]) == 1:
if (i+1) % n == 0:
answer.append(n)
else:
answer.append((i+1) % n)
answer.append(i//n + 1)
break
if len(answer) == 0:
return [0,0]
else:
return answer
def solution(n, words):
for p in range(1, len(words)):
if words[p][0] != words[p-1][-1] or words[p] in words[:p]: return [(p%n)+1, (p//n)+1]
else:
return [0,0]
문제 설명