利用递归判断回文（Java）

public class HuiWen{public static void main(String[] args) {char[] strs = {'2','4','d','4','2'};boolean huiwen = isHuiwen(strs, 0, strs.length -1,strs.length);System.out.println(huiwen);}public static boolean isHuiwen(char a[],int low,int high,int length){if(length == 1 || length == 0)return true;if (a[low] != a[high] || low >= high) {return false;}return isHuiwen(a, low + 1, high -1,length -2);}}