leetcode valid panlidrome

public class Solution {
    public boolean isPalindrome(String s) {
        // Start typing your Java solution below
        if(s.length() == 1 || s.length() == 0 ) return true;
        
        String s2 = s.toLowerCase();
        s2 = s2.replaceAll("[^a-z0-9]", "");
        
        int left = 0; int right = s2.length() - 1;
        while(left < right) {
            if(s2.charAt(left) != s2.charAt(right) ) return false;
            left++;
            right--;
        }
        return true;
    }
}