LeetCode--valid-palindrome

最新推荐文章于 2024-02-20 12:10:12 发布

Miles-

最新推荐文章于 2024-02-20 12:10:12 发布

阅读量178

点赞数

分类专栏： LeetCode 文章标签： LeetCode C++

本文链接：https://blog.csdn.net/wl_ss/article/details/78955727

版权

LeetCode 专栏收录该内容

148 篇文章 0 订阅

订阅专栏

题目描述

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

For example,
"A man, a plan, a canal: Panama"is a palindrome.
"race a car"is not a palindrome.

Note:
Have you consider that the string might be empty? This is a good question to ask during an interview.

For the purpose of this problem, we define empty string as valid palindrome.

//从两头扫描，遇到非字母数子的跳过。
class Solution {
public:
bool isPalindrome(string s) {
        int i,j;
        for(i=0,j=s.length()-1;i<j;++i,--j){
            while(i<j && !isalnum(s[i])) ++i;
            while(i<j && !isalnum(s[j])) --j;
            if (i<j && tolower(s[i])!=tolower(s[j])) return false;
        }
        return true;
    }
};