LeetCode-E-Valid Palindrome

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

hfsmurf

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

阅读量223

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法文章标签： leetcode string palindrome

本文链接：https://blog.youkuaiyun.com/hfsmurf/article/details/72051261

数据结构与算法专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个字符串是否为回文，只考虑字母数字字符并忽略大小写。通过双指针技巧，从两端向中间遍历比较字符，有效排除非字母数字字符，实现了高效判断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意

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.

Subscribe to see which companies asked this question.

解法

遍历

实现

bool isAlphanumeric(char ch){
        if(ch >= 'a' && ch <= 'z' || (ch >= 'A' && ch <= 'Z') || (ch >= '0' && ch <= '9')) return true;
        return false;
    }

    bool isPalindrome(string s) {
        int i = 0, j = s.size() - 1;
        while(i <= j){
            if(!isAlphanumeric(s[i])){
                ++i;
                continue;
            }else if(!isAlphanumeric(s[j])){
                --j;
                continue;
            }else{
               if(tolower(s[i]) != tolower(s[j])) return false;
               ++i;
               --j;
            }
        }
        return true;
    }