段式回文

/*
 * Solution approach:
 * 1. This solution uses a functional style to solve the problem.
 * 2. We utilize streams to iterate over potential lengths of matching substrings.
 * 3. A filter checks if the current split creates matching substrings.
 * 4. We calculate the maximum k based on valid pairs found.
 */
import java.util.stream.IntStream;
public class Solution {
    public int maxK(String text) {
        int n = text.length();
        return IntStream.range(0, n / 2 + 1)
                .filter(len -> IntStream.range(0, len)
                        .allMatch(i -> text.charAt(i) == text.charAt(n - len + i)))
                .map(len -> 2)
                .reduce((k, x) -> k + x)
                .orElse(0) + (n % 2 == 1 ? 1 : 0);
    }
}