ํฐ์คํ ๋ฆฌ ๋ทฐ
algorithm/programmers
[ํ๋ก๊ทธ๋๋จธ์ค] ์์ด ๋๋ง์๊ธฐ / python ํ์ด์ฌ
jen jen 2021. 9. 26. 20:32728x90
๐ป Summer/Winter Coding(~2018)
๋ฌธ์
https://programmers.co.kr/learn/courses/30/lessons/12981
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์์ด ๋๋ง์๊ธฐ
3 ["tank", "kick", "know", "wheel", "land", "dream", "mother", "robot", "tank"] [3,3] 5 ["hello", "observe", "effect", "take", "either", "recognize", "encourage", "ensure", "establish", "hang", "gather", "refer", "reference", "estimate", "executive"] [0,0]
programmers.co.kr
์ฝ๋
๊ทธ๋ฅ ๋ฌธ์ ์์ ํ๋ผ๋๋๋ก ๊ตฌํํ๋ค.
def solution(n, words):
answer = [0,0]
cnt = 0 # ํ๋ฝ๋ฒํธ,์ฐจ๋ก ๊ณ์ฐํ ๋ณ์
checks = [] # ๋์จ ๋จ์ด ํ์ธํ ๋ฆฌ์คํธ
checks.append(words[0])
for i in range(1, len(words)): # ๋จ์ด ์ํํ๋ฉด์
cnt += 1
# ์์ง ์๋์จ ๋จ์ด์ด๋ฉด์ & ์ ๋จ์ด์ ๋ง์ง๋ง ์ํ๋ฒณ๊ณผ ์ผ์นํ๋ฉด checks ๋ฆฌ์คํธ์ ๋ฃ์ (pass)
if words[i] not in checks and list(words[i-1])[-1] == list(words[i])[0]:
checks.append(words[i])
else: # (fail)
answer[0] = cnt%n +1 # ํ๋ฝ๋ฒํธ
answer[1] = cnt//n +1 # ํ๋ฝ์ฐจ๋ก
break
return answer
'algorithm > programmers' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[ํ๋ก๊ทธ๋๋จธ์ค] ์บ์ / python ํ์ด์ฌ (0) | 2021.09.26 |
---|---|
[ํ๋ก๊ทธ๋๋จธ์ค] ๋ฐฐ๋ฌ / python ํ์ด์ฌ (1) | 2021.09.21 |
[ํ๋ก๊ทธ๋๋จธ์ค] ๊ธฐ์ง๊ตญ ์ค์น / python ํ์ด์ฌ (0) | 2021.08.29 |
[ํ๋ก๊ทธ๋๋จธ์ค] ์ซ์ ๊ฒ์ / python ํ์ด์ฌ (0) | 2021.08.29 |
[ํ๋ก๊ทธ๋๋จธ์ค] ์ ํ ๋ฒ์ค / python ํ์ด์ฌ / 2018 ์นด์นด์ค ๊ณต์ฑ 1์ฐจ ์ฝํ (0) | 2021.08.08 |
๋๊ธ
๊ธ ๋ณด๊ดํจ
TAG
- BFS
- dfs
- ๋ธ๋ฃจํธํฌ์ค
- ํ์ด์ฌ
- ํ๋ก๊ทธ๋๋จธ์ค
- 2018 ์นด์นด์ค ๊ณต์ฑ
- merge์๋ฌ
- 20057 ๋ง๋ฒ์ฌ ์์ด์ ํ ๋ค์ด๋
- ์๊ณ ๋ฆฌ์ฆ
- ๋ณด์์ผํ
- ์ผ์ฑ์ฝํ
- 21609 ์์ด ์คํ๊ต
- dp
- Python
- ๋ฐฑ์ค
- merge ์๋ฌ
- ๊ธฐ์ง๊ตญ์ค์น
- ์ผ์ฑ๊ธฐ์ถ
- 2579 ๊ณ๋จ์ค๋ฅด๊ธฐ
- 17406 ๋ฐฐ์ด๋๋ฆฌ๊ธฐ4
- swea
- react
- 20056 ๋ง๋ฒ์ฌ ์์ด์ ํ์ด์ด๋ณผ
- ์์ด๋๋ง์๊ธฐ
- git ๋ฏธ๋ฌ๋ง
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
- Total
- Today
- Yesterday
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ