680. valid palindrome ii

Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.

Example 1:

1 2	Input: "aba" Output: True

Example 2:

1
2
3

Input: "abca"
Output: True
Explanation: You could delete the character 'c'.

class  {
    public boolean validPalindrome(String s) {
        if (s.length() < 2)
          return true;
       int start = 0;
      int end = s.length() - 1;
       while (start < end) {
            if (s.charAt(start) != s.charAt(end)) {
             return isPalindrome(s, start + 1, end) || isPalindrome(s, start, end - 1);
          }
            start++;
         end--;
       }
        return true;
   }

   private boolean isPalindrome(String s, int start, int end) {
        while (start < end) {
            if (s.charAt(start++) != s.charAt(end--)) {
             return false;
          }
        }
        return true;
   }
}

680. valid palindrome ii

近期文章

近期评论

标签

热门

文章归档

分类目录

功能