Leetcode - Valid Palindrome II

https://leetcode.com/problems/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:

Input: "aba"
Output: True

Example 2:

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

func validPalindrome(s string) bool {
    deleted := false
    j := len(s)-1
    result := true
    for i := 0; i <= j; i++ {
        if s[i] != s[j] {
            if deleted {
                result = false
            }
            deleted = true
            j++
        }
        j--
    }
    j = len(s)-1
    deleted = false
    for i := 0; i <= j; i++ {
        if s[i] != s[j] {
            if deleted && !result {
                return false
            }
            deleted = true
            i--
        }
        j--
    }
    return true
}

• 相关文章
• 全局相关文章