class Solution {
public:
bool isPalindrome(string s) {
int left=0;
int right=s.size()-1;
while(left<right){
while(left<right && !isalnum(s[left])){
left+=1;
}
while(left<right && !isalnum(s[right])){
right-=1;
}
if(left<right){
if(tolower(s[left])!=tolower(s[right])){
return false;
}
left+=1;
right-=1;
}
}
return true;
}
};
LEETCODE 125. 验证回文串
最新推荐文章于 2024-06-06 11:58:07 发布