๐๏ธ Algorithm/โฌ ํ๋ก๊ทธ๋๋จธ์ค
โฌ [Programmers] [Python] [Level2] ํ ์ธ ํ์ฌ
Dbswnstjd
2023. 4. 10. 01:00
๋ฌธ์
https://school.programmers.co.kr/learn/courses/30/lessons/131127
ํ๋ก๊ทธ๋๋จธ์ค
์ฝ๋ ์ค์ฌ์ ๊ฐ๋ฐ์ ์ฑ์ฉ. ์คํ ๊ธฐ๋ฐ์ ํฌ์ง์ ๋งค์นญ. ํ๋ก๊ทธ๋๋จธ์ค์ ๊ฐ๋ฐ์ ๋ง์ถคํ ํ๋กํ์ ๋ฑ๋กํ๊ณ , ๋์ ๊ธฐ์ ๊ถํฉ์ด ์ ๋ง๋ ๊ธฐ์ ๋ค์ ๋งค์นญ ๋ฐ์ผ์ธ์.
programmers.co.kr
ํ์ด
# ํ๋ก๊ทธ๋๋จธ์ค 2๋จ๊ณ - ํ ์ธ ํ์ฌ
from collections import Counter
def solution(want, number, discount):
answer = 0
d = dict()
for i in range(len(want)):
d[want[i]] = number[i]
#num = sum(number)
# ์ด์ฐจํผ ์ต๋ 10์ด๊ธฐ ๋๋ฌธ์ ๊ตณ์ด ๊ตฌํ ํ์์์ด 10์ผ๋ก ๋ฌ๋ ๋๋ค.
for i in range(len(discount) - 9): # ์ธ๋ฑ์ค ๋ฒ์ ์กฐ์ฌ
if d == Counter(discount[i:i+10]):
answer += 1
return answer
print(solution(["banana", "apple", "rice", "pork", "pot"],[3, 2, 2, 2, 1],
["chicken", "apple", "apple", "banana", "rice", "apple", "pork", "banana", "pork", "rice", "pot", "banana", "apple", "banana"]))
Counter ๋ฅผ ์ฌ์ฉํด์ ๊ฐ๋จํ๊ฒ ํ ์ ์๋ ๋ฌธ์ .
์ธ๋ฑ์ค ์๋ฅผ ๋ ๋ฒ์๋ง ์กฐ์ฌํ๋ฉด ๋๋ค.