使用递归和字符数组搜索检查回文

Question

我目前正在尝试使用一个函数来比较左侧和右侧字符，以返回一个真或假的布尔值，以确定用户输入的字符串是否为回文，但我得到了一个模糊的错误声明第 44 行。不知道如何进行。我是初级Java程序员，思想开放，愿意学习，所以不要烤我哈哈。import java.util.Scanner;/**** @author owner*/public class Q2_RecursivePalidrome {public static void main(String[] args) {    int leftSideCharacter = 0;    int rightSideCharacter = 0;    Scanner scan = new Scanner (System.in);    System.out.println("Enter word to check whether palidrome: ");    String userInput = scan.next();    char[] checkPalidrome = userInput.toCharArray(); // creates an array of characters    System.out.println(isPalidrome(checkPalidrome, leftSideCharacter, rightSideCharacter));}public static boolean isPalidrome(char[] checkPalidrome, int leftSideCharacter, int rightSideCharacter) {    leftSideCharacter = 0;    rightSideCharacter = checkPalidrome.length - 1; // java arrays start at 0, not 1.    if (rightSideCharacter > leftSideCharacter) { // check both ends of string character by character        // to be palidrome, both sides of string should be same        //         if (checkPalidrome[leftSideCharacter] == checkPalidrome[rightSideCharacter]) {            return (isPalidrome(checkPalidrome, leftSideCharacter + 1, rightSideCharacter - 1));        }        else {            return false;        }    }    return true;}