class Solution
{
public:
bool isDigtalOrWord(char ch)
{
if (isalpha(ch)||isdigit(ch))
return true;
return false;
}
bool isPalindrome(string s)
{
if (s.empty())
return true;
for (int i = 0; i < s.size(); ++i)
s[i] = tolower(s[i]);
int left = 0;
int right = s.size() - 1;
while (left < right)
{
while (left < right && !isDigtalOrWord(s[left]))
left++;
while (left < right && !isDigtalOrWord(s[right]))
right--;
if (s[left] != s[right])
return false;
left++;
right--;
}
return true;
}
};
541. 反转字符串 II
最新推荐文章于 2024-04-23 21:35:22 发布