[LeetCode] 680. Valid Palindrome II - Java

• 문제 링크

Valid Palindrome II - LeetCode

 

• 풀이 코드

public class Solution {

    public boolean validPalindrome(String s) {
        int l = -1, r = s.length();
        while (++l < --r) if (s.charAt(l) != s.charAt(r)) return isPalindrome(s, l + 1, r) || isPalindrome(s, l, r - 1);

        return true;
    }

    private boolean isPalindrome(String s, int l, int r) {
        while (l < r) if (s.charAt(l++) != s.charAt(r--)) return false;

        return true;
    }

}