Java -通过递归的方式测试字符数组是否为回文

public class PalindromeTest {
    public static boolean isPalindrome(char[] arr) {
        return isPalindromeHelper(arr, 0, arr.length - 1);
    }

    private static boolean isPalindromeHelper(char[] arr, int start, int end) {
        if (start >= end) {
            return true; // Base case: empty or single character array is a palindrome
        }

        if (arr[start] != arr[end]) {
            return false; // Characters at start and end positions are not equal, not a palindrome
        }

        return isPalindromeHelper(arr, start + 1, end - 1); // Recursively check the remaining characters
    }

    public static void main(String[] args) {
        char[] arr1 = {'a', 'b', 'c', 'b', 'a'};
        char[] arr2 = {'a', 'b', 'c', 'd', 'e'};

        System.out.println(isPalindrome(arr1)); // Output: true
        System.out.println(isPalindrome(arr2)); // Output: false
    }
}