我目前正在嘗試使用一個(gè)函數(shù)來(lái)比較左側(cè)和右側(cè)字符，以返回一個(gè)真或假的布爾值，以確定用戶輸入的字符串是否為回文，但我得到了一個(gè)模糊的錯(cuò)誤聲明第 44 行。不知道如何進(jìn)行。我是初級(jí)Java程序員，思想開(kāi)放，愿意學(xué)習(xí)，所以不要烤我哈哈。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;}