๋ฌด์ง์ฑ ์ฝ๋ฉ... def solution(queue1, queue2): answer = 0 lenQ = len(queue1) * len(queue2) while answer sum(queue2): queue2.append(queue1.pop(0)) else: queue1.append(queue2.pop(0)) answer += 1 if sum(queue1) == sum(queue2): return answer return -1 ํ ์คํธ ์ผ์ด์ค๋ ์ ๋์ง๋ง, ํ ์คํธ 1 ์ ๋ ฅ๊ฐ ใ[3, 2, 7, 2], [4, 6, 5, 1] ๊ธฐ๋๊ฐ ใ2 ์คํ ๊ฒฐ๊ณผ ใํ ์คํธ๋ฅผ ํต๊ณผํ์์ต๋๋ค. ํ ์คํธ 2 ์ ๋ ฅ๊ฐ ใ[1, 2, 1, 2], [1, 10, 1, 2] ๊ธฐ๋๊ฐ ใ7 ์คํ ๊ฒฐ..