leetcode125. Valid Palindrome

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

原创最新推荐文章于 2024-02-20 12:10:12 发布 · 350 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

32 篇文章

订阅专栏

字符串

8 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个字符串是否为回文，只考虑字母和数字字符，并忽略大小写。通过双指针法跳过特殊字符进行比较，实现了一个高效的解决方案。

easy程度题

题目:

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.

此题要注意细节，只比较同时是字母或数字的字符

AC解:

class Solution {
public:
    bool isPalindrome(string s) 
    {
        if (s.empty())
            return true;
            
        int front = 0,back = s.length() - 1;
        while (front < back)
        {
            while (!isalnum(s[front]) && front < s.length())//跳过特殊字符
                front++;
            if (front == s.length())//全为特殊字符，字符串为回文
                break;
                
            while (!isalnum(s[back]))//跳过特殊字符
                back--;
                
            if (isalpha(s[front]) && isalpha(s[back]))//都是字符
            {
                if (tolower(s[front]) != tolower(s[back]))
                    return false;
            }
            else
            {
                if (s[front] != s[back])
                    return false;
            }
            front++;
            back--;
        }
        
        return true;
    }
};