算法 LCR_019_验证回文串II 求解代码 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 public boolean validPalindrome(String s) { int len = s.length(); int left = 0; int right = len-1; while(left<right){ if(s.charAt(left)==s.charAt(right)){ left++; right--; }else{ return valid(s,left+1,right)||valid(s, left, right-1); } } return true; } public boolean valid(String s,int left,int right) { while (left<right) { if(s.charAt(left)!=s.charAt(right)){ return false; } left++; right--; } return true; }