[LeetCode] Valid Palindrome II 验证回文字符串之二

标签：code   exp   character   字符串   most   out   string   tput   lan   

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‘.

Note:

1. The string will only contain lowercase characters a-z. The maximum length of the string is 50000.

s

[LeetCode] Valid Palindrome II 验证回文字符串之二

标签：code   exp   character   字符串   most   out   string   tput   lan   

原文地址：http://www.cnblogs.com/grandyang/p/7618468.html