프로그래머스 - 두 큐 합 같게 만들기 (L2)

 1from collections import deque
 2
 3def solution(queue1, queue2):
 4    sum1, sum2 = sum(queue1), sum(queue2)
 5    dq1 = deque(queue1)
 6    dq2 = deque(queue2)
 7    cnt = 0
 8
 9    while cnt <= len(queue1)*2+1 and sum1 != sum2:
10        if sum1 > sum2:
11            tmp = dq1.popleft()
12            dq2.append(tmp)
13            sum1 -= tmp
14            sum2 += tmp
15        elif sum1 < sum2:
16            tmp = dq2.popleft()
17            dq1.append(tmp)
18            sum1 += tmp
19            sum2 -= tmp
20        cnt += 1
21        
22    return cnt if sum1 == sum2 else -1