class Solution {
    
    // 최대 합계 원형 하위 배열
    public int maxSubarraySumCircular(int[] nums) {
        int totalSum = 0;
        int curSum1 = 0, curSum2 = 0;
        int maxSum = Integer.MIN_VALUE, minSum = Integer.MAX_VALUE;
        
        for (int a : nums) {
            totalSum += a;
            
            curSum1 += a;
            maxSum = Math.max(curSum1, maxSum);
            if (curSum1 < 0) curSum1 = 0;
            
            curSum2 += a;
            minSum = Math.min(curSum2, minSum);
            if (curSum2 > 0) curSum2 = 0;
        }
        
        if (maxSum < 0) return maxSum;
        
        return Math.max(maxSum, totalSum - minSum);
    }
}