用递归方式判断字符串是否是回文

package zzm;

import java.util.Scanner;

public class Hw {
    static  Scanner input=new Scanner(System.in);
    public static void main(String[] args) {
    System.out.print("请输入一串字符：");
    String str=input.next();     
    boolean ab=find(str,0,str.length());
    System.out.println(ab);
    }
    private static boolean find(String str,int n1,int n2) {
        if(n2<=1)          
            return true;
        else if(str.toCharArray()[n1]==str.toCharArray()[n2-1]){   
            return find(str,n1+1,n2-1);
        }
     return false;
}
}