验证回文串 II

/*
 * Problem: Given a string s, determine if it can become a palindrome by removing at most one character.
 * 
 * Approach:
 * 1. Convert the string to a list of characters.
 * 2. Use Java Stream to filter out the mismatched character.
 * 3. Check if the resulting substring is a palindrome after removing the mismatched character.
 */
 
import java.util.stream.IntStream;
 
public class Solution {
    public boolean validPalindrome(String s) {
        int left = 0, right = s.length() - 1;
        while (left < right) {
            if (s.charAt(left) != s.charAt(right)) {
                int finalLeft = left, finalRight = right;
                return IntStream.range(0, 2).anyMatch(i -> isPalindrome(s, finalLeft + i, finalRight - (1 - i)));
            }
            left++;
            right--;
        }
        return true;
    }
    
    private boolean isPalindrome(String s, int left, int right) {
        return IntStream.range(left, (right + left + 1) / 2)
                .allMatch(i -> s.charAt(i) == s.charAt(right - i + left));
    }
}