[프로그래머스] 두 큐 합 같게 만들기

from collections import deque

def solution(queue1, queue2):
    queue1 = deque(queue1)
    queue2 = deque(queue2)
    queue1_sum = sum(queue1)
    queue2_sum = sum(queue2)
    cnt = 0 
    
    while queue1 and queue2:
        if queue1_sum == queue2_sum:
            break
            
        if cnt > (len(queue1) + len(queue2))*2:
            return -1
            
        if queue1_sum < queue2_sum:
            tmp = queue2.popleft()
            queue1.append(tmp)
            queue1_sum += tmp
            queue2_sum -= tmp
            cnt += 1
            
        elif queue1_sum > queue2_sum:
            tmp = queue1.popleft()
            queue2.append(tmp)
            queue1_sum -= tmp
            queue2_sum += tmp
            cnt += 1
    
    if not queue1 or not queue2:
        return -1
    
    return cnt