[프로그래머스]Lv.2 두 큐 합 같게 만들기 C#

https://school.programmers.co.kr/learn/courses/30/lessons/118667

프로그래머스

소스코드

using System;
using System.Collections.Generic;
using System.Linq;

public class Solution
{
    public int solution(int[] queue1, int[] queue2)
    {
        int answer = 0;

        Queue<long> q1 = new Queue<long>(queue1.Select(s => (long)s));
        Queue<long> q2 = new Queue<long>(queue2.Select(s => (long)s));

        long sum1 = q1.Sum();
        long sum2 = q2.Sum();
        long allSum = sum1 + sum2;
        long div = allSum / 2;
        double maxCount = queue1.Length + queue2.Length * 2;

        if (sum1 == sum2)
            return 0;

        if (allSum % 2 == 1)
            return -1;

        for (int i = 0; i < maxCount; i++)
        {
            if (sum1 == div)
                return answer;

            if (sum1 < div)
            {
                sum1 += q2.Peek();
                q1.Enqueue(q2.Dequeue());
            }
            else
            {
                sum1 -= q1.Peek();
                q2.Enqueue(q1.Dequeue());
            }
            answer++;
        }
        return -1;
    }
}