删除字符串两端相同字符后的最短长度

/*
 * Problem Statement: Given a string s consisting of characters 'a', 'b', and 'c',
 * you can perform the following operation any number of times:
 * 1. Choose a non-empty prefix where all characters are the same.
 * 2. Choose a non-empty suffix where all characters are the same.
 * 3. The prefix and suffix must not overlap.
 * 4. The characters in the prefix and suffix must be the same.
 * 5. Remove both the prefix and suffix.
 * The goal is to return the shortest possible length of the string after performing these operations.
 */
import java.util.stream.IntStream;
public class Solution {
    public int minimumLength(String s) {
        int left = 0;
        int right = s.length() - 1;
        while (left < right && s.charAt(left) == s.charAt(right)) {
            char currentChar = s.charAt(left);
            // Move left pointer to the right using IntStream
            left = IntStream.range(left, s.length()).filter(i -> s.charAt(i) != currentChar).findFirst().orElse(s.length());
            // Move right pointer to the left using IntStream
            right = IntStream.rangeClosed(0, right).map(i -> right - i).filter(i -> s.charAt(i) != currentChar).findFirst().orElse(-1);
        }
        return Math.max(0, right - left + 1);
    }
}