回文 用递归实现 java

import java.io.*;
public class huiwen
{
 
 
 
 
 public static void main(String args[]) throws Exception
 {

  System.out.println("put in some character");
  String str;
  BufferedReader r=new BufferedReader(new InputStreamReader(System.in),256);
  str=r.readLine();
  
  System.out.println(huiwen(str,0,str.length()-1));
  
 }
 
 public static boolean huiwen(String s,int start,int end)   //用递归实现判断回文
 {
  if(start>=end) return true;
  if(s.charAt(start)==s.charAt(end))
   return huiwen(s,start+11,end-1);
  else
   return false;
  
 }

}