拼接数组的最大分数

/*
 * Problem: Given two integer arrays nums1 and nums2, both of length n, you can choose two integers left and right such that 0 <= left <= right < n and swap the subarrays nums1[left...right] and nums2[left...right].
 * You can perform this operation once or not at all. The score of the arrays is the maximum value of sum(nums1) and sum(nums2).
 * Return the maximum possible score.
 */

import java.util.stream.IntStream;

public class MaxScoreAfterSwapStream {
    public static int maxScoreAfterSwap(int[] nums1, int[] nums2) {
        int sum1 = IntStream.of(nums1).sum();
        int sum2 = IntStream.of(nums2).sum();

        int maxScore = Math.max(sum1, sum2);
        int diff1 = 0, diff2 = 0;

        for (int i = 0; i < nums1.length; i++) {
            diff1 += nums2[i] - nums1[i];
            diff2 += nums1[i] - nums2[i];
            maxScore = Math.max(maxScore, Math.max(sum1 + diff1, sum2 + diff2));
            if (diff1 < 0) diff1 = 0;
            if (diff2 < 0) diff2 = 0;
        }

        return maxScore;
    }

    public static void main(String[] args) {
        int[] nums1 = {20, 40, 20, 70, 30};
        int[] nums2 = {50, 20, 50, 40, 20};
        System.out.println(maxScoreAfterSwap(nums1, nums2)); // Output: 220
    }
}