使用合并操作将数组转换为回文序列

/*
 * Problem Statement:
 * Given an array of integers, we need to perform merge operations to convert it into a palindrome. 
 * A merge operation consists of choosing two adjacent elements in the array and replacing them with their sum. 
 * Our goal is to minimize the number of merge operations required.
 */

import java.util.Arrays;
import java.util.stream.IntStream;

public class SolutionStream {
    // Function to find the minimum number of merge operations to make array a palindrome
    public int minMergeOperations(int[] nums) {
        int left = 0;
        int right = nums.length - 1;
        int merges = 0;

        while (left < right) {
            if (nums[left] == nums[right]) {
                left++;
                right--;
            } else if (nums[left] < nums[right]) {
                nums[left + 1] += nums[left];
                left++;
                merges++;
            } else {
                nums[right - 1] += nums[right];
                right--;
                merges++;
            }
        }

        return merges;
    }

    public static void main(String[] args) {
        SolutionStream solution = new SolutionStream();
        int[] nums = {1, 4, 5, 1};
        System.out.println(solution.minMergeOperations(nums)); // Output should be 1
    }
}