leetcode-680-验证回文字符串
class Solution {
public:
bool validPalindrome(string s) {
int left = 0, right = s.length() - 1, flag = 0, temp = 0;
bool res_r=true, res_l=true;
while (left <= right) {
if (s[left] != s[right]) {
if (flag == 1) res_r = false;
else {
//right--;
temp = left;
left--;
flag = 1;
}
}
left++;
right--;
}
if (res_r == true) return true;
left = temp;
right = s.length() - 1 - left;
flag = 0;
while (left <= right) {
if (s[left] != s[right]) {
if (flag == 1) res_l = false;
else {
//left++;
right++;
flag = 1;
}
}
left++;
right--;
}
return res_l;
}
};
int main()
{
Solution sol;
string input = "deeee";
cout << sol.validPalindrome(input) << endl;
return 0;
}
- LeetCode 680:验证回文字符串
- 验证回文字符串(leetcode)
- leetcode-验证回文字符串
- [LeetCode] Valid Palindrome II 验证回文字符串之二
- LeetCode 125. Valid Palindorme (验证回文字符串)
- LeetCode 680.验证回文字符串 Ⅱ
- LeetCode-探索-初级-字符串-验证回文字符串-java
- [LeetCode] 680. Valid Palindrome II 验证回文字符串 II
- golang_算法: leetcode_字符串05-验证回文字符串
- LeetCode:验证回文字符串(Python版本)
- LeetCode 680. Valid Palindrome II (验证回文字符串 Ⅱ)
- Leetcode 680.验证回文字符串
- leetcode最长回文字符串_动态规划
- 【leetcode】第5题:找出字符串中最长的回文字符串
- Palindrome Partitioning 分割字符串为回文@LeetCode
- leetcode 680. Valid Palindrome II 去除一个字符的回文字符串判断 + 双指针
- 验证回文字符串
- LeetCode之“字符串”:最短回文子串
- LeetCode(Palindrome partition 2) 求将一个字符串划分成回文子串 需要分成的段数最少是多少
- Leetcode:最长回文字符串